IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v329y2018icp384-394.html
   My bibliography  Save this article

Clar structures vs Fries structures in hexagonal systems

Author

Listed:
  • Zhai, Shaohui
  • Alrowaili, Dalal
  • Ye, Dong

Abstract

A hexagonal system H is a 2-connected bipartite plane graph such that all inner faces are hexagons, which is often used to model the structure of a benzenoid hydrocarbon or graphen. A perfect matching of H is a set of disjoint edges which covers all vertices of H. A resonant set S of H is a set of hexagons in which every hexagon is M-alternating for some perfect matching M. The Fries number of H is the size of a maximum resonant set and the Clar number of H is the size of a maximum independent resonant set (i.e. all hexagons are disjoint). A pair of hexagonal systems with the same number of vertices is called a contra-pair if one has a larger Clar number but the other has a larger Fries number. In this paper, we investigates the Fries number and Clar number for hexagonal systems, and show that a catacondensed hexagonal system has a maximum resonant set containing a maximum independent resonant set, which is conjectured for all hexagonal systems. Further, our computation results demonstrate that there exist many contra-pairs.

Suggested Citation

  • Zhai, Shaohui & Alrowaili, Dalal & Ye, Dong, 2018. "Clar structures vs Fries structures in hexagonal systems," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 384-394.
    • Handle: RePEc:eee:apmaco:v:329:y:2018:i:c:p:384-394
    DOI: 10.1016/j.amc.2018.02.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318301164
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.02.014?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zhao, Shuang & Zhang, Heping, 2016. "Forcing polynomials of benzenoid parallelogram and its related benzenoids," Applied Mathematics and Computation, Elsevier, vol. 284(C), pages 209-218.
    2. Li, Wei & Qin, Zhongmei & Zhang, Heping, 2016. "Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 30-38.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shi, Lingjuan & Zhang, Heping, 2019. "Counting Clar structures of (4, 6)-fullerenes," Applied Mathematics and Computation, Elsevier, vol. 346(C), pages 559-574.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Shi, Lingjuan & Zhang, Heping & Zhao, Lifang, 2022. "The anti-forcing spectra of (4,6)-fullerenes," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    2. Tingzeng Wu & Huazhong Lü, 2019. "The Extremal Permanental Sum for a Quasi-Tree Graph," Complexity, Hindawi, vol. 2019, pages 1-4, May.
    3. Li, Shuchao & Wei, Wei, 2018. "Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial," Applied Mathematics and Computation, Elsevier, vol. 328(C), pages 45-57.
    4. Wu, Tingzeng & So, Wasin, 2019. "Unicyclic graphs with second largest and second smallest permanental sums," Applied Mathematics and Computation, Elsevier, vol. 351(C), pages 168-175.
    5. Zhang, Yaxian & Zhang, Heping, 2022. "Continuous forcing spectrum of regular hexagonal polyhexes," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    6. Wu, Tingzeng & Lai, Hong-Jian, 2018. "On the permanental sum of graphs," Applied Mathematics and Computation, Elsevier, vol. 331(C), pages 334-340.
    7. Li, Wei & Qin, Zhongmei & Wang, Yao, 2020. "Enumeration of permanental sums of lattice graphs," Applied Mathematics and Computation, Elsevier, vol. 370(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:329:y:2018:i:c:p:384-394. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.