期刊
LINEAR ALGEBRA AND ITS APPLICATIONS
卷 325, 期 1-3, 页码 71-74出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/S0024-3795(00)00333-5
关键词
maximum matching; matching number; Laplacian spectrum
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. (C) 2001 Elsevier Science Inc. All rights reserved. AMS classification: 05c50.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据