IDEAS home Printed from https://ideas.repec.org/a/hin/complx/9728976.html
   My bibliography  Save this article

Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs

Author

Listed:
  • Xiaolin Chen
  • Huishu Lian

Abstract

The matching energy of a graph was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial . The largest matching root is the largest root of the matching polynomial . Let denote the complete - partite graph with order , where . In this paper, we prove that, for the given values and , both the matching energy and the largest matching root of complete - partite graphs are minimal for complete split graph and are maximal for Turán graph .

Suggested Citation

  • 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.
  • Handle: RePEc:hin:complx:9728976
    DOI: 10.1155/2019/9728976
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2019/9728976.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2019/9728976.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/9728976?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
    ---><---

    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. 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.
    3. Monsalve, Juan & Rada, Juan & Shi, Yongtang, 2019. "Extremal values of energy over oriented bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 342(C), pages 26-34.
    Full references (including those not matched with items on IDEAS)

    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. Shao, Yanling & Gao, Yubin, 2019. "The maximal geometric-arithmetic energy of trees with at most two branched vertices," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    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. 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.

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:9728976. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.