Abstract
In the field of chemical graph theory, the stability of molecular structures is often linked to their resonance properties. This paper provides a complete characterization of the $k$-resonance of the Cartesian product graph $P_3 \times C_n$ for $n \ge 4$. We demonstrate that $P_3 \times C_n$ is universally 1-, 2-, and 3-resonant for all even $n$. Furthermore, we establish that these graphs are not $k$-resonant for $k \ge 4$ when $n \ge 10$, with specific exceptions for smaller cycles. A key corollary of this work is that $P_3 \times C_n$ is maximally resonant if and only if it is 4-resonant.
Introduction
The concept of resonance is a cornerstone of mathematical chemistry, particularly in explaining the stability of benzenoid hydrocarbons and fullerenes. A graph is said to be $k$-resonant if any set of $i \le k$ disjoint even faces forms a resonant pattern—meaning there exists a perfect matching $M$ such that the boundary of every chosen face is $M$-alternating.
While resonance has been thoroughly explored in hexagonal systems, the Cartesian product graph $P_3 \times C_n$ presents a unique structural challenge. This graph, which can be visualized as three concentric $n$-cycles connected by radial edges, serves as a model for specific polycyclic configurations.
Structural Characterization
The graph $P_3 \times C_n$ consists of $3n$ vertices and $5n$ edges. It contains $2n$ quadrangular faces (labeled $f_1, \dots, f_n$ and $g_1, \dots, g_n$) and two $n$-gonal faces (the internal face $f^{n+1}$ and the external face $g^{n+1}$).
As shown in the figure above, the vertices are indexed as $v_i^j$ where $j \in \{1, 2, 3\}$ represents the ring layer and $i \in \{1, \dots, n\}$ represents the position on the cycle.
Methodology and Perfect Matchings
To prove the resonance properties, the authors constructed four fundamental perfect matchings, denoted $M_1, M_2, M_3,$ and $M_4$. These matchings provide the "base" configurations from which resonant patterns for specific faces can be derived.
The proof strategy involves:
- Symmetry Exploitation: Categorizing face combinations based on their relative positions in the concentric rings.
- Symmetric Difference (⊕): Using the symmetric difference of edge sets to transform one perfect matching into another that accommodates the required resonant faces.
- Combinatorial Counting: For higher-order resonance ($k \ge 4$), the authors used vertex counting arguments to show that for large $n$, certain face combinations isolate "odd components," making a perfect matching impossible.
Key Results
The study yields a definitive classification of resonance for this graph family:
- Universal 3-Resonance: Every graph $P_3 \times C_n$ (for even $n \ge 4$) is 1-, 2-, and 3-resonant. This implies a high degree of structural "flexibility" where any three disjoint faces can simultaneously participate in a resonant state.
- The 4-Resonance Threshold: Resonance properties become highly sensitive to the cycle size $n$ once $k$ reaches 4. For $n \ge 10$, the graph is no longer 4-resonant.
- Maximality: A significant finding is that for this family, "maximal resonance" (being resonant for all possible $k$) is equivalent to being 4-resonant.
Exceptional Cases
The limits of resonance for small $n$ are as follows:
- $P_3 \times C_4$ is maximally resonant.
- $P_3 \times C_6$ is 4-resonant.
- $P_3 \times C_8$ is 5-resonant.
Conclusion
This research provides a complete mathematical map of the resonance capabilities of $P_3 \times C_n$. By identifying the transition point at $n=10$ where 4-resonance fails, the authors have defined the structural limits of this graph family. These findings contribute to the broader understanding of how local resonant patterns interact with global graph topology, offering insights that may eventually inform the design of stable molecular architectures.
Summary updated