pith. sign in

arxiv: 1210.5322 · v1 · pith:FQGNUF44new · submitted 2012-10-19 · 🧮 math.CO

A relation between Clar covering polynomial and cube polynomial

classification 🧮 math.CO
keywords polynomialclarcoveringsomecalledcoverscubehexagonal
0
0 comments X
read the original abstract

The Clar covering polynomial (also called Zhang-Zhang polynomial in some chemical literature) of a hexagonal system is a counting polynomial for some types of resonant structures called Clar covers, which can be used to determine Kekul\'e count, the first Herndon number and Clar number, and so on. In this paper we find that the Clar covering polynomial of a hexagonal system H coincides with the cube polynomial of its resonance graph R(H) by establishing a one-to-one correspondence between the Clar covers of H and the hypercubes in R(H). Accordingly, some applications are presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.