Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6872580 | Discrete Applied Mathematics | 2014 | 6 Pages |
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 κ (resp. chromatic number Ï) which has the maximum matching energy.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Shuli Li, Weigen Yan,