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

Extremal values of matching energies of one class of graphs

Author

Listed:
  • Chen, Lin
  • Liu, Jinfeng

Abstract

In 1978, Gutman proposed the concept of graph energy, defined as the sum of the absolute values of eigenvalues of the adjacency matrix of a molecular graph, which is related to the energy of π-electrons in conjugated hydrocarbons. Recently, Gutman and Wagner proposed the concept of matching energy and pointed out that the chemical applications of matching energy go back to the 1970s. In this paper, we study the extremal values of the matching energy and characterize the graphs with minimal matching energy among all tricyclic graphs with a given diameter. Our methods can help to find more extremal values for other classes of molecular networks and the results suggest the structures with extremal energies.

Suggested Citation

  • Chen, Lin & Liu, Jinfeng, 2016. "Extremal values of matching energies of one class of graphs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 976-992.
    • Handle: RePEc:eee:apmaco:v:273:y:2016:i:c:p:976-992
    DOI: 10.1016/j.amc.2015.10.025
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Chen, Lin & Liu, Jinfeng, 2015. "The bipartite unicyclic graphs with the first ⌊n−34⌋ largest matching energies," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 644-656.
    2. Matthias Dehmer & Abbe Mowshowitz & Yongtang Shi, 2014. "Structural Differentiation of Graphs Using Hosoya-Based Indices," PLOS ONE, Public Library of Science, vol. 9(7), pages 1-4, July.
    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. Xiaolin Chen & Huishu Lian, 2019. "Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs," Complexity, Hindawi, vol. 2019, pages 1-7, April.

    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. Xiaolin Chen & Huishu Lian, 2019. "Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs," Complexity, Hindawi, vol. 2019, pages 1-7, April.
    2. Li, Hong-Hai & Wu, Qian-Qian & Gutman, Ivan, 2016. "On ordering of complements of graphs with respect to matching numbers," Applied Mathematics and Computation, Elsevier, vol. 282(C), pages 167-174.
    3. Matthias Dehmer & Yury Robertovich Tsoy, 2014. "Numerical Evaluation and Comparison of Kalantari's Zero Bounds for Complex Polynomials," PLOS ONE, Public Library of Science, vol. 9(10), pages 1-10, October.
    4. Lang, Rongling & Li, Tao & Mo, Desen & Shi, Yongtang, 2016. "A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 115-121.
    5. Ghorbani, Modjtaba & Hakimi-Nezhaad, Mardjan & Dehmer, Matthias, 2022. "Novel results on partial hosoya polynomials: An application in chemistry," Applied Mathematics and Computation, Elsevier, vol. 433(C).
    6. Cao, Shujuan & Dehmer, Matthias & Kang, Zhe, 2017. "Network Entropies Based on Independent Sets and Matchings," Applied Mathematics and Computation, Elsevier, vol. 307(C), pages 265-270.

    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:273:y:2016:i:c:p:976-992. 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.