The Clar covering polynomial (Zhang-Zhang polynomial) of a hexagonal system is a counting polynomial of resonant structures called Clar covers, which can be used to determine the Kekulé count, the first Herndon number and Clar number. In this paper we prove that the Clar covering polynomial of a hexagonal system H coincides with the cube polynomial of its resonance graph R(H) by establishing a bijection between the Clar covers of H and the hypercubes in R(H). Moreover, some important applications of this relation are presented.
|Number of pages||16|
|Journal||MATCH Communications in Mathematical and in Computer Chemistry|
|Publication status||Published - 2013|
Scopus Subject Areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics