Subgraphs and the Laplacian spectrum of a graph

被引:7
|
作者
Teranishi, Yasuo [1 ]
机构
[1] Meijo Univ, Dept Math, Nagoya, Aichi 4648602, Japan
关键词
Graph spectra; Laplacian matrix; Tree;
D O I
10.1016/j.laa.2011.02.019
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let G be a graph and H a subgraph of G. In this paper, a set of pairwise independent subgraphs that are all isomorphic copies of His called an H-matching. Denoting by v(H. G) the cardinality of a maximum H-matching in G, we investigate some relations between v(H, G) and the Laplacian spectrum of G. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:1029 / 1033
页数:5
相关论文
共 50 条