The matching energy of graphs with given parameters
Gutman and Wagner [I. Gutman, S. Wagner, The matching energy of a graph, Discrete Appl. Math. 160 (2012) 21772187] defined the matching energy of a graph and gave some properties and asymptotic results of the matching energy. In this paper, we characterize the connected graph G G with the connectivity ? ? (resp. chromatic number ? ? ) which has the maximum matching energy.
matching energy connectivity chromatic number