Extremal matching energy and the largest matching root of complete multipartite graphs (Q2325219): Difference between revisions

Summary: The matching energy \(\mathrm{ME}(G)\) of a graph \(G\) was introduced by \textit{I. Gutman} and \textit{S. Wagner} [Discrete Appl. Math. 160, No. 15, 2177--2187 (2012; Zbl 1252.05120)], which is defined as the sum of the absolute values of the roots of the matching polynomial \(m(G, x)\). The largest matching root \(\lambda_1(G)\) is the largest root of the matching polynomial \(m(G, x)\). Let \(K_{n_1, n_2, \dots, n_r}\) denote the complete \(r\)-partite graph with order \(n = n_1 + n_2 + \dots + n_r\), where \(r > 1\). In this paper, we prove that, for the given values \(n\) and \(r\), both the matching energy \(\mathrm{ME}(G)\) and the largest matching root \(\lambda_1(G)\) of complete \(r\)-partite graphs are minimal for complete split graph \(\mathrm{CS}(n, r - 1)\) and are maximal for Turán graph \(T(n, r)\).