Note: The matching energy of graphs with given parameters

  • Authors:

  • Shuli Li;Weigen Yan

  • Affiliations:

  • -;-

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2014

Quantified Score

Hi-index 0.04

Visualization

Abstract

Gutman and Wagner [I. Gutman, S. Wagner, The matching energy of a graph, Discrete Appl. Math. 160 (2012) 2177-2187] 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 with the connectivity @k (resp. chromatic number @g) which has the maximum matching energy.