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

Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial

Author

Listed:
  • Li, Wei
  • Qin, Zhongmei
  • Zhang, Heping

Abstract

A hexagonal system is a graphical representation of a benzenoid hydrocarbon in theoretical chemistry. A hexagonal chain is a cata-condensed hexagonal system with no branchings. In this paper we consider extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial. We prove that the linear chain attains the minimum value of this sum and the zigzag chain attains the maximum value of this sum.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:apmaco:v:291:y:2016:i:c:p:30-38
    DOI: 10.1016/j.amc.2016.06.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316303964
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.06.025?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.

    Citations

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


    Cited by:

    1. Tingzeng Wu & Huazhong Lü, 2019. "The Extremal Permanental Sum for a Quasi-Tree Graph," Complexity, Hindawi, vol. 2019, pages 1-4, May.
    2. 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.
    3. Wu, Tingzeng & Lai, Hong-Jian, 2018. "On the permanental sum of graphs," Applied Mathematics and Computation, Elsevier, vol. 331(C), pages 334-340.
    4. Li, Wei & Qin, Zhongmei & Wang, Yao, 2020. "Enumeration of permanental sums of lattice graphs," Applied Mathematics and Computation, Elsevier, vol. 370(C).
    5. 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.
    6. 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.

    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:291:y:2016:i:c:p:30-38. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.