Title of article :
A relation between the matching number and Laplacian spectrum of a graph Original Research Article
Author/Authors :
Guo Ji Ming، نويسنده , , Tan Shang Wang، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
Let G be a graph, its Laplacian matrix is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. In this paper, we generalize a result in (R. Merris, Port. Math. 48 (3) 1991) and obtain the following result: Let G be a graph and M(G) be a maximum matching in G. Then the number of edges in M(G) is a lower bound for the number of Laplacian eigenvalues of G exceeding 2.
Keywords :
Maximum matching , Matching number , Laplacian spectrum
Journal title :
Linear Algebra and its Applications
Journal title :
Linear Algebra and its Applications