Abstract
The Clar covering polynomial is a recently proposed concept of hexagonal systems by which some important topological indices such as perfect matching count, Clar number, first Herndon number, etc., can be easily obtained. In this paper we establish a relationship between the Clar covering polynomial and sextet polynomial. A lower bound of the Clar number and some properties of coefficients of the Clar covering polynomial are thus deduced. It is mentioned that the summation of coefficients of Clar covering polynomial can be used to calculate the number of perfect matchings of a certain kind of polyominoes relating to crystal physics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
