The resonance graphs of coronoid systems and nanotubes

Abstract: The resonance graph of a hexagonal system is connected, which shows that a perfect matching can be transformed into any other perfect matchings by a series of flips along hexagons. However, the resonance graph of a coronoid system (with holes) is not necessarily connected. Saldanha et al. (Discrete Comput. Geom. 14 (1995) 207-233) used homology and cohomology theory to obtain three versions of criteria for two tilings of a quadriculated region in the plane to be in the same connected component of the flip graph. Inspiblack by the combinatorial version, in this paper we use a purely graph-theoretical approach to give a criterion in terms of simple invariant\textcolor{black}{---flow} across cuts between holes/exterior face for two perfect matchings of a coronoid system $G$ to be in the same connected component of its resonance graph. As a corollary we obtain a criterion for the resonance graph of a coronoid system to be connected. We also discuss whether such \textcolor{black}{criteria} are applicable to nanotubes, and construct a nanotube whose resonance graph is connected, which disproves a conjecture proposed by Tratnik et al. (MATCH Commun. Math. Comput. Chem. 74 (2015) 175-186).

• The paper establishes that two perfect matchings of a matchable coronoid system lie in the same resonance-graph component exactly when their flows across each of the selected cut segments are equal.
• The paper proves that a coronoid resonance graph is connected exactly when every nice cycle is an I-cycle, showing how holes create disconnected components and providing structural tests for connectivity.
• The paper refutes the conjecture that every matchable nanotube has a disconnected resonance graph by constructing infinitely many connected examples, while showing that the flow criterion requires elementarity for nanotubes.

The resonance graph of a graph encodes how perfect matchings relate to one another via local flips along interior faces, and for hexagonal systems (benzenoid graphs) it is always connected. This paper by Liang and Zhang (2608.16687) addresses the analogous question for coronoid systems—hexagonal systems with holes—where connectivity fails in general, and for nanotubes. The central contribution is a purely graph-theoretic criterion, in terms of an integer invariant called the flow across cuts, for deciding when two perfect matchings of a coronoid system lie in the same connected component of its resonance graph. The paper also refutes a published conjecture about nanotubes.

Background and motivation

The resonance (Z-transformation) graph $R_6(G)$ of a hexagonal or coronoid system $G$ has the perfect matchings (Kekulé structures) of $G$ as vertices, with an edge between two matchings whose symmetric difference is exactly the six-edge boundary of one hexagon—a flip. Connectivity of $R_6(G)$ means any Kekulé structure can be reached from any other by a sequence of hexagon flips, a property tied to Herndon's resonance theory and to estimates of resonance energy via degree sums.

Connectivity is well understood for hexagonal systems, where $R_6(G)$ is connected with vertex connectivity equal to the minimum degree, and for plane elementary bipartite graphs, where Zhang and Zhang showed $R(G)$ is connected if and only if $G$ is weakly elementary. For coronoid systems, however, holes obstruct flips: the boundary cycles of holes and the exterior face are not allowed to flip. A small single-coronoid example in the paper has 40 perfect matchings whose resonance graph splits into one large component and two singleton components, so connectivity genuinely fails.

The methodological inspiration comes from Saldanha, Tomei, Casarin, and Romualdo, who characterized connected components of the flip graph of domino tilings of quadriculated regions with holes using homology, cohomology, and a combinatorial flow invariant across cuts between holes. The paper translates this combinatorial idea into the hexagonal-lattice setting without any homological machinery.

The flow invariant and the main theorem

For a coronoid system $G$ with $n$ holes $h_1,\dots,h_n$ and exterior face $G$0, a cut segment $G$1 is a directed path in the dual graph $G$2 whose endpoints correspond to two distinct non-hexagonal faces and whose internal vertices correspond to hexagons; the set $G$3 of primal edges crossed by $G$4 is a cut. The flow of a perfect matching $G$5 across $G$6 counts matching edges crossing $G$7 with sign $G$8 if the white endpoint lies left of $G$9 and $G$0 if it lies right:

$G$1

Using a spanning tree $G$2 of $G$3 containing all non-hexagonal face vertices (with leaves exactly at those vertices), rooted at $G$4, one selects $G$5 cut segments jointly connecting all holes and the exterior face; by duality, deleting the corresponding cuts leaves a connected subgraph all of whose interior faces are hexagons.

The main result states: two perfect matchings of a matchable coronoid system with $G$6 holes lie in the same connected component of $G$7 if and only if their flows across each of the $G$8 chosen cut segments are equal.

The proof rests on a key parity lemma: for an $G$9-alternating cycle $R_6(G)$0 and a cut line $R_6(G)$1, the flows of $R_6(G)$2 and $R_6(G)$3 across $R_6(G)$4 restricted to $R_6(G)$5 are equal when both endpoints of $R_6(G)$6 lie on the same side of $R_6(G)$7, and differ by exactly $R_6(G)$8 otherwise. Necessity then follows because hexagons are I-cycles (their interiors contain no hole), so a flip never changes the flow across any cut segment. Sufficiency is proved by induction on the number of alternating cycles in $R_6(G)$9: equal flows force the matchings to be balanced around each hole—an equal number of proper and improper $R_6(G)$0-alternating II-cycles enclose each hole—and this balancing allows a coronoid subgraph to be peeled off and flipped via a path lemma for plane elementary bipartite graphs, reducing the induction.

The authors also note a refinement: if $R_6(G)$1 pairwise internally disjoint cut segments can be chosen, their orientations may be arbitrary, since reversing a cut segment negates both flows. They concede, however, that it is not known whether such disjoint cut segments always exist.

Connectivity criterion for coronoid systems

As a corollary of the flow criterion, the paper proves: the resonance graph of a matchable coronoid system is connected if and only if every nice (resonant) cycle of $R_6(G)$2 is an I-cycle, i.e., bounds a hole-free (hexagonal) region.

An immediate consequence is that every elementary coronoid system has a disconnected resonance graph, since the boundary of each hole is a nice II-cycle. This is consistent with the weakly-elementary criterion of Zhang and Zhang for plane bipartite graphs, but is stated directly in the coronoid language. The paper also exhibits a single coronoid whose four central vertical edges are forbidden, so all nice cycles are I-cycles and $R_6(G)$3—a $R_6(G)$4 chessboard graph. For a two-hole elementary coronoid, computation shows the resonance graph has 334 vertices partitioned into three singleton components and three non-singleton components.

Nanotubes and the refuted conjecture

The paper then treats open-ended single-walled nanotubes, viewed as finite subgraphs of a hexagonal tessellation of a cylinder of $R_6(G)$5-type, with the two open ends (cycles of length at least 4) playing the roles of hole and exterior face. Tratnik and Žigert Pleteršek conjectured that the resonance graph of every matchable nanotube is disconnected.

This conjecture is false. The authors construct a nanotube $R_6(G)$6 with four forbidden edges; removing them yields two isomorphic hexagonal chains of four hexagons each, and by the Cartesian-product decomposition of restricted resonance graphs over elementary components, $R_6(G)$7 is connected. Infinitely many such counterexamples follow by the same construction. The conjecture does hold for elementary nanotubes: every elementary nanotube has a nice II-cycle, hence a disconnected resonance graph.

The connectivity criterion generalizes: a matchable nanotube has connected resonance graph if and only if every nice cycle is either an I-cycle or bounds a hexagonal system—equivalently, no elementary component is a genuine (non-degenerate) subnanotube. Regarding the flow criterion itself, the necessity direction extends verbatim to nanotubes, but sufficiency fails in general: for a non-elementary $R_6(G)$8-type nanotube with all vertical edges forbidden, two distinct perfect matchings share the same flow $R_6(G)$9 across a cut segment yet are isolated vertices of the resonance graph. For elementary nanotubes, however, the full flow criterion is re-established by an argument mirroring the coronoid proof, using the fact that the region between a proper and an improper alternating cycle is an elementary plane bipartite graph in that case (a fact that fails without elementarity, as the counterexample shows).

Limitations and open questions

Several qualifications are explicit in the paper. The sufficiency of the flow criterion depends on the chosen cut segments forming a tree structure rooted at the exterior face; the authors' stronger version with arbitrarily oriented, internally disjoint cut segments rests on the unproven existence of such disjoint segments. For nanotubes, the flow criterion is established only under elementarity, and the non-elementary counterexample shows elementarity cannot simply be dropped—characterizing exactly which non-elementary nanotubes admit a flow criterion remains open. The nanotube connectivity criterion is stated for matchable nanotubes but its sufficiency argument relies on the decomposition into elementary components being either hexagonal systems or degenerate subnanotubes, a structural fact specific to this class.

Conclusion

This paper transfers the combinatorial core of the Saldanha–Tomei–Casarin–Romualdo theory of domino-tiling flip graphs to hexagonal lattices, giving a complete, purely graph-theoretic flow criterion for component membership in the resonance graphs of coronoid systems and elementary nanotubes. The derived connectivity criteria are clean structural statements in terms of nice cycles, and the construction of connected-resonance-graph nanotubes decisively settles the 2015 conjecture of Tratnik and Žigert Pleteršek in the negative while delineating the elementary case where that conjecture's spirit survives.