Skip to main content

Honeycombs and Macrocyles

Small rings in chemistry are usually laid out as polygons; 5-membered rings as a pentagon, 6-membered as a hexagon, and so on. Once you get beyond about 9-10, this tends to look a little nasty. Or at least, unconventional.

So for 'macrocycles', it makes sense to make a less circular, and more wavy outline. Or, to be more exact, there is an inner cycle and several outer cycles, like this:

To make it clearer, I have used a chemical-like structure with oxygens in the inner ring. These crown ethers are a particularly clear-cut case, as the ethylene linkages force the particular geometry of the drawing. However, it is not so obvious for other sizes of rings - what possible arrangements are there?

Well, it occurred to me today that there is a simple formula for these macrocycle drawings. For a ring of size n with an inner ring of size i and outer rings or size o, you have to have n = (i * o) - i. The formula can be rearranged, but the idea is that you add up all the outer rings and remove the inner one.


So here are some crude representations of such cycles, for n in {9, 12, 14}. Below each cycle is the list of outer cycles. All of these examples are regular, in that they have the same number of vertices in the outer cycle. It is possible - although less desirable - to have different numbers of vertices in the outer cycles.


The version on the left is somewhat uglier than the 'puffed out' one on the left, but on some sense they are the same drawing. They are both (4, 6, 4, 6) in the notation of the previous image. Note that 24 = 4 + 6 + 4 + 6 - 4, which suggests that the previous formula can be generalised a bit to : n = (x0, ..., xr) - r. Each x in the equation is a ring size, and it is the sum of these minus the number of rings.

This immediately suggested a way to make examples - use partitions again! In other words, partitions of n + r for r in the range (3, floor(n / 3)). This produces a whole lot of horrible drawings, such as (3, 3, 9), but it does work. The code is here.

Comments

Popular posts from this blog

Generating Dungeons With BSP Trees or Sliceable Rectangles

So, I admit that the original reason for looking at sliceable rectangles was because of this gaming stackoverflow question about generating dungeon maps. The approach described there uses something called a binary split partition tree (BSP Tree) that's usually used in the context of 3D - notably in the rendering engine of the game Doom. Here is a BSP tree, as an example:



In the image, we have a sliced rectangle on the left, with the final rectangles labelled with letters (A-E) and the slices with numbers (1-4). The corresponding tree is on the right, with the slices as internal nodes labelled with 'h' for horizontal and 'v' for vertical. Naturally, only the leaves correspond to rectangles, and each internal node has two children - it's a binary tree.

So what is the connection between such trees and the sliceable dual graphs? Well, the rectangles are related in exactly the expected way:


Here, the same BSP tree is on the left (without some labels), and the slicea…

Common Vertex Matrices of Graphs

There is an interesting set of papers out this year by Milan Randic et al (sorry about the accents - blogger seems to have a problem with accented 'c'...). I've looked at his work before here.

[1] Common vertex matrix: A novel characterization of molecular graphs by counting
[2] On the centrality of vertices of molecular graphs

and one still in publication to do with fullerenes. The central idea here (ho ho) is a graph descriptor a bit like path lengths called 'centrality'. Briefly, it is the count of neighbourhood intersections between pairs of vertices. Roughly this is illustrated here:


For the selected pair of vertices, the common vertices are those at the same distance from each - one at a distance of two and one at a distance of three. The matrix element for this pair will be the sum - 2 - and this is repeated for all pairs in the graph. Naturally, this is symmetric:


At the right of the matrix is the row sum (∑) which can be ordered to provide a graph invarian…

Signatures with user-defined edge colors

A bug in the CDK implementation of my signature library turned out to be due to the fact that the bond colors were hard coded to just recognise the labels {"-", "=", "#" }. The relevant code section even had an XXX above it!

Poor show, but it's finally fixed now. So that means I can handle user-defined edge colors/labels - consider the complete graph (K5) below:

So the red/blue colors here are simply those of a chessboard imposed on top of the adjacency matrix - shown here on the right. You might expect there to be at least two vertex signature classes here : {0, 2, 4} and {1, 3} where the first class has vertices with two blue and two red edges, and the second has three blue and two red.

Indeed, here's what happens for K4 to K7:

Clearly even-numbered complete graphs have just one vertex class, while odd-numbered ones have two (at least?). There is a similar situation for complete bipartite graphs:

Although I haven't explored any more of these…