[Nauty] Nauty Digest, Vol 43, Issue 3

[Mehmet Aziz YİRİK]

Dear NAUTY Developers and Prof. McKay,

In a graph generation process; a generator adds bonds in all possible ways and creates the list of intermediate graphs. This process continues in a recursive manner until reaching the given degree constraints. Not to have the duplicate intermediate graphs in the generation process; we need to add the bonds which keep the extended molecule also canonical. That is what I mean by the canonical extension. In the documentation, there is addedgeg function but it is not exactly what I asked. So I asked whether there is such a function in nauty rather than getting the canonical labelling and checking the canonical extension for all the bonds.

Kind Regards,
Aziz

________________________________
From: Nauty <nauty-bounces at anu.edu.au> on behalf of nauty-request at anu.edu.au <nauty-request at anu.edu.au>
Sent: 19 November 2019 04:00
To: nauty at anu.edu.au <nauty at anu.edu.au>
Subject: Nauty Digest, Vol 43, Issue 3

Send Nauty mailing list submissions to
        nauty at anu.edu.au

To subscribe or unsubscribe via the World Wide Web, visit
        http://mailman.anu.edu.au/mailman/listinfo/nauty
or, via email, send a message with subject or body 'help' to
        nauty-request at anu.edu.au

You can reach the person managing the list at
        nauty-owner at anu.edu.au

When replying, please edit your Subject line so it is more specific
than "Re: Contents of Nauty digest..."


Today's Topics:

   1. Canonical Extension of A Graph (Mehmet Aziz YIRIK)
   2. Re: Canonical Extension of A Graph (Brendan McKay)


----------------------------------------------------------------------

Message: 1
Date: Mon, 18 Nov 2019 21:05:45 +0000
From: Mehmet Aziz YIRIK <mehmetazizyirik at outlook.com>
To: "nauty at anu.edu.au" <nauty at anu.edu.au>
Subject: [Nauty] Canonical Extension of A Graph
Message-ID:
        <PR3P193MB065196F9AA2874F11BFB8EA9A84D0 at PR3P193MB0651.EURP193.PROD.OUTLOOK.COM>

Content-Type: text/plain; charset="iso-8859-1"

Dear Nauty Developers,

Does NAUTY provide a function, returning the list all canonical extensions of a graph ? In other words, rather than checking whether an extension of a graph is canonical or not for every possible bond adding, does NAUTY provide such a function just to return the list all canonical bond addings to a graph ?

I went through the documentation. There is addedgeg function but it is not exactly what I am looking for. It is again checking for all the bond addings one by one.

Thanks;
Aziz


------------------------------

Message: 2
Date: Mon, 18 Nov 2019 23:27:41 +0000
From: Brendan McKay <Brendan.McKay at anu.edu.au>
To: "nauty at anu.edu.au" <nauty at anu.edu.au>
Subject: Re: [Nauty] Canonical Extension of A Graph
Message-ID: <11f67a31-543d-9401-06b6-6274921f1299 at anu.edu.au>
Content-Type: text/plain; charset="utf-8"

Dear Aziz,

What you are asking for is not properly defined.? That is, "canonical
extension" is not a concept whose meaning is agreed on.

Perhaps if you tell us what you are hoping to do we may be able to
advise you.

Brendan.

On 19/11/19 8:05 am, Mehmet Aziz YIRIK wrote:
> Dear Nauty Developers,
>
> Does NAUTY provide a function, returning the list all canonical extensions of a graph ? In other words, rather than checking whether an extension of a graph is canonical or not for every possible bond adding, does NAUTY provide such a function just to return the list all canonical bond addings to a graph ?
>
> I went through the documentation. There is addedgeg function but it is not exactly what I am looking for. It is again checking for all the bond addings one by one.
>
> Thanks;
> Aziz
> _______________________________________________
> Nauty mailing list
> Nauty at anu.edu.au
> http://mailman.anu.edu.au/mailman/listinfo/nauty



------------------------------

Subject: Digest Footer

_______________________________________________
Nauty mailing list
Nauty at anu.edu.au
http://mailman.anu.edu.au/mailman/listinfo/nauty


------------------------------

End of Nauty Digest, Vol 43, Issue 3
************************************