[Paper Review] Iterated altans and their properties

Nino Bašić, Tomaž Pisanski|arXiv (Cornell University)|Apr 30, 2015

Graph theory and applications4 citations

TL;DR

This paper introduces and analyzes iterated altans—graph-theoretic constructions derived by repeatedly attaching a ring of vertices and edges to the periphery of a graph. It establishes that the number of Kekulé structures in the n-th iterated altan is exactly 2^n times the original graph's Kekulé count, enabling exact enumeration for nanotubes and nanocaps. The work further classifies bipartite altans and proves that convex benzenoid patches generate fullerene nanotubes via the altan operation.

ABSTRACT

Recently a class of molecular graphs, called altans, became a focus of attention of several theoretical chemists and mathematicians. In this paper we study primary iterated altans and show, among other things, their connections with nanotubes and nanocaps. The question of classification of bipartite altans is also addressed. Using the results of Gutman we are able to enumerate Kekulé structures of several nanocaps of arbitrary length.

Motivation & Objective

• To formalize and analyze the properties of iterated altans, a graph operation derived from molecular and planar systems.
• To classify when altans remain bipartite, showing it depends on the original graph’s bipartition and peripheral vertex coloring.
• To establish connections between altans and nanotubes/nanocaps, particularly in the context of benzenoid systems and fullerene patches.
• To provide a method for exact enumeration of Kekulé structures in iterated altans using a recursive doubling principle.

Proposed method

• The altan operation is defined as a graph transformation that adds a peripheral cycle of length 2k to a graph G with a cyclically ordered peripheral root S of size k.
• The construction attaches new vertices S₀ and S₁ to G, forming a new cycle C of length 2k, with edges linking S to S₀ and S₁ forming the new peripheral root.
• The operation is iterated n times, denoted Aⁿ(G,S), to generate iterated altans.
• The paper uses graph coloring and cycle parity arguments to derive conditions for bipartiteness of altans.
• It applies Gutman’s result that each altan doubles the number of Kekulé structures to derive the formula K(Aⁿ(G)) = 2ⁿ × K(G).
• The connection to nanotubes is established by showing that the first altan of a convex patch with boundary code 2ᵏ produces a (k,1)-nanotube, and iterated altans add (k,n−1)-nanotubes.

Experimental results

Research questions

• RQ1 Under what conditions is the altan of a graph bipartite?
• RQ2 How does the number of Kekulé structures evolve under repeated altan operations?
• RQ3 Which benzenoid systems generate nanotubes or nanocaps via the altan construction?
• RQ4 What is the relationship between the boundary code of a patch and the resulting altan’s structure?
• RQ5 Can the altan operation be used to systematically generate fullerene nanotubes from convex patches?

Key findings

• The n-th iterated altan of a graph G has exactly 2ⁿ × K(G) Kekulé structures, where K(G) is the number of Kekulé structures in G.
• An altan is bipartite if and only if the original graph is bipartite and all peripheral vertices belong to the same bipartition set.
• The first altan of a convex benzenoid patch (with no consecutive 1s in its boundary code) produces a (k,1)-nanotube, and iterated altans generate (k,s)-nanotubes.
• A patch Π with p pentagons and boundary code (2+a₁)(2+a₂)…(2+aₖ) produces an altan with exactly 6 pentagons and d + p = 6, where d = Σaᵢ.
• The altan of a patch with a single pentagon results in a structure with six pentagons, forming a buckyball dome, and subsequent altans extend this into capped nanotubes.
• The altan operation preserves the width of the tube and transforms convex patches into fullerene nanotubes, confirming that convexity is necessary and sufficient for nanotube formation.