![](/images/graphics-bg.png)
Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs
Joint Authors
Source
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-04-16
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
The matching energy ME(G) of a graph G was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial m(G,x).
The largest matching root λ1(G) is the largest root of the matching polynomial m(G,x).
Let Kn1,n2,…,nr denote the complete r-partite graph with order n=n1+n2+…+nr, where r>1.
In this paper, we prove that, for the given values n and r, both the matching energy ME(G) and the largest matching root λ1(G) of complete r-partite graphs are minimal for complete split graph CS(n,r-1) and are maximal for Turán graph T(n,r).
American Psychological Association (APA)
Chen, Xiaolin& Lian, Huishu. 2019. Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs. Complexity،Vol. 2019, no. 2019, pp.1-7.
https://search.emarefa.net/detail/BIM-1133346
Modern Language Association (MLA)
Chen, Xiaolin& Lian, Huishu. Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs. Complexity No. 2019 (2019), pp.1-7.
https://search.emarefa.net/detail/BIM-1133346
American Medical Association (AMA)
Chen, Xiaolin& Lian, Huishu. Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs. Complexity. 2019. Vol. 2019, no. 2019, pp.1-7.
https://search.emarefa.net/detail/BIM-1133346
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1133346