Skip to main content

Stuck : Detailed Description

Ok, so this is the detailed version of the previous post.

To recap; the structure generation code is still missing a vital piece - the canonical checking. I have been implementing Jean-Loup Faulon's algorithm for generation, but there is no precise algorithm given for canonical checking. Here the relevant paragraph from the enumeration paper:

"Checking for canonicity is a common procedure of orderly enumeration algorithms, the procedure guarantees that the graphs generated are nonisomorphic. ...To verify that a graph is canonical, one labels the vertices of the graph in all possible ways. The graph is canonical if the initial labeling leads to a list of edges that is lexicographically smaller than the lists obtained with all other labelings. In the present paper, we have implemented two algorithms to verify canonicity, Tarjan tree canonization algorithm if the tested graph is acyclic and McKay’s Nauty technique otherwise"
Okay, so I don't understand this for a couple of reasons : firstly, 'labelling all possible ways' sounds like an n-factorial (n!) operation; secondly, nauty does not lexicographically compare edge strings (as far as I know). Sadly, I know that I have misunderstood something, since my code doesn't work, and theirs does. :(

The technique used by nauty is also used by bliss and saucy and is known as iterative refinement of partitions. A 'partition' is a division of a set into subsets called 'cells', and refinement of a partition roughly means making a finer partition that has cells at least as small, if not smaller that the original. The end of the refinement process are 'discrete' partitions that are the same as permutations, since each cell has only one member. This is sketched in the image below:

A simple implementation of a partition refiner is in my repository. It is a slightly modified version of the algorithm from a book I've mentioned before (CAGES). It tries to deal with vertex and edge colours, although I don't think that it does so all that well. However, for simple graphs, it does indeed produce the automorphism group, as well as check for a canonical graph.

For example, the simple 5-cycle graph in the image might be canonical (or 'canonically labelled') if the refinement process produces the identity permutation as the first discrete partition. This will depend on the particular cell selection algorithm, and the choice made of how to arrange newly split cells.

The modifications I made to the CAGES refiner were done to align the canonical checking with the graph enumeration process. This is important, as edges are added to a graph in a characteristic order, and this has to produce graphs that will be accepted as canonical. This is illustrated in the following image:

The cycle graphs are laid out in a standard way on the left, and in a linear view on the right. The linear view emphasises the order in which the edges might be added. In the canonical scheme I have chosen, vertices are connected to the next possible partner. To put it another way, the resulting graphs will have a minimal edge 'length' when laid out as a linear graph.

What the partition refinement process is doing is the same as labelling all possible ways. The leaves of the refinement tree are permutations. Assuming the refinement process gives automorphic permutations, this is almost the same as labelling within the orbits of the atoms. It seems like partitioning the atoms by signature, then refining this partition should work, but it doesn't.

Any better suggestions or clarifications are very welcome :)


Popular posts from this blog

How many isomers of C4H11N are there?

One of the most popular queries that lands people at this blog is about the isomers of C4H11N - which I suspect may be some kind of organic chemistry question on student homework. In any case, this post will describe how to find all members of a small space like this by hand rather than using software.

Firstly, lets connect all the hydrogens to the heavy atoms (C and N, in this case). For example:

Now eleven hydrogens can be distributed among these five heavy atoms in various ways. In fact this is the problem of partitioning a number into a list of other numbers which I've talked about before. These partitions and (possible) fragment lists are shown here:

One thing to notice is that all partitions have to have 5 parts - even if one of those parts is 0. That's not strictly a partition anymore, but never mind. The other important point is that some of the partitions lead to multiple fragment lists - [3, 3, 2, 2, 1] could have a CH+NH2 or an NH+CH2.

The final step is to connect u…

The Gale-Ryser Theorem

This is a small aside. While reading a paper by Grüner, Laue, and Meringer on generation by homomorphism they mentioned the Gale-Ryser (GR) theorem. As it turns out, this is a nice small theorem closely related to the better known Erdős-Gallai (EG).

So, GR says that given two partitions of an integer (p and q) there exists a (0, 1) matrixA iff p*dominatesq such that the row sum vector r(A) = p and the column sum vector c(A) = q.

As with most mathematics, that's quite terse and full of terminology like 'dominates' : but it's relatively simple. Here is an example:

The partitions p and q are at the top left, they both sum to 10. Next, p is transposed to get p* = [5, 4, 1] and this is compared to q at the bottom left. Since the sum at each point in the sequence is greater (or equal) for p* than q, the former dominates. One possible matrix is at the top left with the row sum vector to the right, and the column sum vector below.

Finally, the matrix can be interpreted as a bi…

Havel-Hakimi Algorithm for Generating Graphs from Degree Sequences

A degree sequence is an ordered list of degrees for the vertices of a graph. For example, here are some graphs and their degree sequences:

Clearly, each graph has only one degree sequence, but the reverse is not true - one degree sequence can correspond to many graphs. Finally, an ordered sequence of numbers (d1 >= d2 >= ... >= dn > 0) may not be the degree sequence of a graph - in other words, it is not graphical.

The Havel-Hakimi (HH) theorem gives us a way to test a degree sequence to see if it is graphical or not. As a side-effect, a graph is produced that realises the sequence. Note that it only produces one graph, not all of them. It proceeds by attaching the first vertex of highest degree to the next set of high-degree vertices. If there are none left to attach to, it has either used up all the sequence to produce a graph, or the sequence was not graphical.

The image above shows the HH algorithm at work on the sequence [3, 3, 2, 2, 1, 1]. Unfortunately, this produce…