Abstract
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 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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.