Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs
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-...
Saved in:
Main Authors: | Xiaolin Chen, Huishu Lian |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2019/9728976 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Ordering of the Unicyclic Graphs with respect to Largest Matching Root with Given Matching Number
by: Luozhong Gong, et al.
Published: (2022-01-01) -
Some Conclusion on Unique k-List Colorable Complete Multipartite Graphs
by: Yanning Wang, et al.
Published: (2013-01-01) -
Decompositions of Circulant-Balanced Complete Multipartite Graphs Based on a Novel Labelling Approach
by: A. El-Mesady, et al.
Published: (2022-01-01) -
Disjoint Steiner Trees in the Balanced Complete Multipartite Networks
by: Yinkui Li, et al.
Published: (2024-01-01) -
Conditional Matching Preclusion Number of Graphs
by: Yalan Li, et al.
Published: (2023-01-01)