Matching Forcing Polynomials of Constructable Hexagonal Systems

DOI10.46793/match.88-3.767ZzbMath1503.92089arXiv2109.13709OpenAlexW3201921222MaRDI QIDQ5050743

Shuang Zhao

Publication date: 17 November 2022

Published in: Match Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.13709

Mathematics Subject Classification ID

Graph polynomials (05C31) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items (3)

Binary Coding of Resonance Graphs of Catacondensed Polyhexes ⋮ Matching anti-forcing polynomials of catacondensed hexagonal systems ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs

Cites Work

• Anti-forcing spectra of perfect matchings of graphs
• Hexagonal systems with forcing single edges
• The minimum forcing number for the torus and hypercube
• Forcing matchings on square grids
• Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
• Forcing polynomials of benzenoid parallelogram and its related benzenoids
• On the forced matching numbers of bipartite graphs
• Hexagonal systems with forcing edges
• Continuous forcing spectra of even polygonal chains
• Continuous forcing spectrum of regular hexagonal polyhexes
• Forcing and anti-forcing polynomials of perfect matchings of a pyrene system
• Anti-forcing numbers of perfect matchings of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matching Forcing Polynomials of Constructable Hexagonal Systems