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

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).