Skip to main content

External Symmetry Numbers and Graph Automorphism Groups

So, there was a question on BioStar about calculating the 'external symmetry number' of a molecule - something I hadn't heard of, but turns out to be something like the subgroup of rotations and reflections of the automorphism group of a graph. Since I have some code to calculate the automorphism group, I naïvely thought it would be simple...

The questioner - Nick Vandewiele - kindly provided some test cases, which ended up as this code. Although many of these tests now pass, they only do so because I commented out the hydrogen adding! :)

On the one hand, there are some recent improvements that try to handle vertex and edge 'colors' - in other words, element symbols and bond orders. For example, consider the improbable molecule C1OCO1 :
These are the three permutations that leave the carbons and the oxygens in the same positions; when you include the identity, that makes 4. Cyclobutane (without hydrogens!) has a symmetry group of order 8. Similarly, cyclobutadiene now gives 4 instead of 8.

So what goes wrong when there are hydrogens? Well, it's a deeper problem than just hydrogens, but it starts there. Consider methane : it has an external symmetry number of 12, but my code gives 24 - why? Well the main answer is 'inversion', look:

The permutation (0)(1)(2, 3)(4) just swaps hydrogens 2 and 3. This effectively changes the chirality of the molecule ... sortof. It's not actually chiral, but its a reasonable description of the transformation. Apparently, this does happen (another thing I didn't know; there are lots more :) according to this document, but quite slowly compared to rotations - "slower than 1 cycle s-1".

This kind of pseudo-chirality will happen at any tetrahedral center. Or at any atom with 4 neighbours, I think - like XeF4, which is square planar. As an example, take this spira-fused ring system:

with a transform that swaps 7 and 9 but not the pairs (0, 5)(1, 4)(2, 3). Effectively this changes the parity at carbon 6. Somehow I doubt that this kind of 'movement' actually occurs in solution, but I could well be wrong. In any case, it seems likely that the external symmetry number is 2, and not 4.

In summary, it is probably not possible to calculate the external symmetry number correctly without 3D coordinates, or symmetry axes, or point groups. I have a feeling that the positional info could be recorded as a 3D combinatorial map which would give explicit orientations for atoms with four neighbours.

Comments

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…

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…

Generating Trees

Tree generation is a well known (and solved!) problem in computer science. On the other hand, it's pretty important for various problems - in my case, making tree-like fusanes. I'll describe here the slightly tortuous route I took to make trees.

Firstly, there is a famous theorem due to Cayley that the number of (labelled) trees on n vertices is nn - 2 which can be proved by using Prüfer sequences. That's all very well, you might well say - but what does all this mean?

Well, it's not all that important, since there is a fundamental problem with this approach : the difference between a labelled tree and an unlabelled tree. There are many more labeled trees than unlabeled :


There is only one unlabeled tree on 3 vertices, but 3 labeled ones
this is easy to check using the two OEIS sequences for this : A000272 (labeled) and A000055 (unlabeled). For n ranging from 3 to 8 we have [3, 16, 125, 1296, 16807, 262144] labeled trees and [1, 2, 3, 6, 11, 23] unlabeled ones. Only 23 …