On the maximal matching energy of graphs

WU Ting-Zeng

doi:10.3969/j.issn.1000-5641.2015.01.017

Issue 1

Mar. 2015

Turn off MathJax

Article Contents

Article Navigation > Journal of East China Normal University (Natural Sciences) > 2015 > (1): 136-141

WU Ting-Zeng. On the maximal matching energy of graphs[J]. Journal of East China Normal University (Natural Sciences), 2015, (1): 136-141. doi: 10.3969/j.issn.1000-5641.2015.01.017

Citation:

WU Ting-Zeng. On the maximal matching energy of graphs[J]. Journal of East China Normal University (Natural Sciences), 2015, (1): 136-141. doi: 10.3969/j.issn.1000-5641.2015.01.017

WU Ting-Zeng. On the maximal matching energy of graphs[J]. Journal of East China Normal University (Natural Sciences), 2015, (1): 136-141. doi: 10.3969/j.issn.1000-5641.2015.01.017

Citation:

WU Ting-Zeng. On the maximal matching energy of graphs[J]. Journal of East China Normal University (Natural Sciences), 2015, (1): 136-141. doi: 10.3969/j.issn.1000-5641.2015.01.017

PDF( 251 KB)

On the maximal matching energy of graphs

doi: 10.3969/j.issn.1000-5641.2015.01.017

WU Ting-Zeng^,

1.
School of Mathematics and Statistics, Qinghai Nationalities University, Xining 810007, China

Received Date: 2014-05-01
Publish Date: 2015-01-25

Abstract

Abstract

The matching energy is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph, which was firstly proposed by Gutman and Wagner (The matching energy of a graph, Discrete Appl. Math. 2012 (160): 21772187). And they showed that the complete graph Kn had maximum matching energy in all graphs on n vertices. In this paper, among all graphs on n vertices, the graphs with i-th maximal matching energy are completely characterized, where i = 2, 3, . . . , 16.
- matching polynomial,
- matching energy,
- Hosoya index

FullText(HTML)

References(1)

References

[1]

GODSIL C D. Algebraic Combinatorics [M]. New York: Chapman and Hall, 1993.
GUTMAN I, WAGNER S. The matching energy of a graph [J]. Discrete Appl Math, 2012 (160): 2177--2187.
JI S J, LI X L, SHI Y T. Extremal matching energy of bicyclic graphs [J]. MATCH Commun Math Comput Chem, 2013 (70): 697--706.
LI S L, YAN W G. The matching energy of graphs with given parameters [J]. Discrete Appl Math, 2014 (162): 415--420.
ZHANG H P, WU T Z, LAI H J. Per-spectral characterizations of some edge-deleted subgraphs of a complete graph [J]. Linear and Multilinear Algebra, 2015 (63): 397-410.
LOVASZ L. Combinatorial Problems and Exercises [M]. Akadémiai Kiadó: Budapest, 1993. MOHAR B. Some applications of Laplace eigenvalues of graphs [M]//HAHN G, EDS G S. Graph Symmetry. Dordrecht: Kluwer Academic Press, 1997, 225-275.
CAO D S, HONG Y. The distribution of eigenvalues of graphs [J]. Linear Algebra and its Application, 1995 (216): 211-224.
SHEARER J B. On the distribution of the maximum eigenvalue of graphs [J]. Linear Algebra and its Application, 1984 (114/115): 17-20.
GUO J M. The limit points of Laplacian spectra of graphs [J]. Linear Algebra and its Application, 2003 (362): 121-128.
GUO J M. On limit points of Laplacian spectral radii of graphs [J]. Linear Algebra and its Application, 2008 (429): 1705-1718.
SHU J L. Bounds on Eigenvalues of Graphs (in Chinese) [D]. Shanghai: East China Normal University, 1999.
VO\'ASZ L, PELINK\'AN J. On the eigenvalues of tress [J]. Periodica Math Hung 1973 (3): 175-182.
DOOB M. The limit points of eigenvalues of graphs [J]. Linear Algebra and its Application, 1989 (114/115): 659-662.
GRONE R, MERRIS R, SUNDER V. The Laplacian spetrum of a graph [J]. SIAM J Matrix Anal Appl, 1990 (11): 218-238.
MERRIS R. Laplacian matrices of graphs:a surver [J]. Linear Algebra and its Application, 1994 (197/198): 143-176.
ZHANG X D. Graphs with fourth Laplacian eigenvalue less than two [J]. European Journal of Combinatorics, 2003 (24): 617-630.

Relative Articles

Supplements(0)

Cited By

Proportional views