Generalized hexagonal systems with each hexagon being resonant
A hexagonal system (HS) is a finite 2-connected planar graph in which each interior face is a regular hexagon of side length 1, and a generalized hexagonal system (GHS) is a graph obtained by deleting some interior vertices and interior edges from a HS. An edge of a GHS is said to be not fixed if it belongs to some but not all perfect matchings of the GHS. The main result of the paper is the following: A GHS has no fixed edge if and only if the boundaries of its infinite face and nonhexagon faces are alternating cycles. Moreover, if a GHS has no fixed edge then every face of it is an alternating cycle. Here a cycle is called alternating if it is alternating with respect to some perfect matching.
- When each hexagon of a hexagonal system covers it
- Regular coronoid systems
- Reducible chains of planar 1-cycle resonant graphs
- Plane elementary bipartite graphs
- Coronoid systems with perfect matchings
- On plane bipartite graphs without fixed edges
- The unfixed subgraph of a catacondensed hexagonal system obtained by fixing an alternating set
- scientific article; zbMATH DE number 4168723 (Why is no real title available?)
- Hexagonal resonance of (3,6)-fullerenes
- 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
- The structural properties of \(\{(2, 3), 6 \}\)-spheres
- Maximally resonant polygonal systems
- The resonance graphs of coronoid systems and nanotubes
- Benzenoid links
- Elementary components of essentially disconnected polyomino graphs
- \(k\)-resonant toroidal polyhexes
- Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system
This page was built for publication: Generalized hexagonal systems with each hexagon being resonant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186165)