Abstract
A graphene fragment is a benzenoid graph that its dualist graph is a unicyclic graph. In particular, when the dualist graph of a benzenoid graph is a circle, it is called cyclofusene. In this paper, we determine the Clar number of a cyclofusene graph, and prove a bound for the Clar number of the graphene fragment. Moreover, we construct the graphene fragment which can attain this bound. More precisely, it is shown that the Clar number of the graphene fragment with n hexagons is at most $$[\frac{2n}{3}]$$ .
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 callSimilar Papers
Disclaimer: 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.
