Open AccessOn the tricyclic graphs with three disjoint 6-cycles and maximum matching energy
Author(s) -
Yun-Xia Zhou,
Honghai Li
Publication year - 2015
Publication title -
tamkang journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 18
eISSN - 0049-2930
pISSN - 2073-9826
DOI - 10.5556/j.tkjm.46.2015.1768
Subject(s) - combinatorics , disjoint sets , mathematics , matching (statistics) , tricyclic , vertex (graph theory) , 3 dimensional matching , cograph , graph , discrete mathematics , bipartite graph , chordal graph , 1 planar graph , stereochemistry , chemistry , statistics
The matching energy of a graph was introduced recently by Gutman and Wagner and defined as the sum of the absolute values of zeros of its matching polynomial. In this paper, we characterize graphs that attain the maximum matching energy among all connected tricyclic graphs of order $n$ with three vertex-disjoint $C_6$'s.