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

Xiaolin Chen and Huishu Lian

Complexity, 2019, vol. 2019, 1-7

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 .

Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/9728976.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/9728976.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9728976

DOI: 10.1155/2019/9728976

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().