Article ID Journal Published Year Pages File Type
418962 Discrete Applied Mathematics 2008 13 Pages PDF
Abstract

Sextet rotations of the perfect matchings of a hexagonal system H   are represented by the sextet-rotation-tree R(H)R(H), a directed tree with one root. In this article we find a one-to-one correspondence between the non-leaves of R(H)R(H) and the Clar covers of H, without alternating hexagons. Accordingly, the number (nl  ) of non-leaves of R(H)R(H) is not less than the number (cs) of Clar structures of H  . We obtain some simple necessary and sufficient conditions, and a criterion for cs=nlcs=nl, that are useful for the calculation of Clar polynomials. A procedure for constructing hexagonal systems with cs

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , ,