应用数学2012，Vol.25Issue(3)：603-607,5.
子图匹配数与图无符号拉普拉斯谱
Subgraphs Matching Number and Signless Laplacian Spectra of Graphs
摘要
Abstract
Let G be a graph and H be a subgraph of G.A set of pairwise independent subgraphs G that are all isomorphic to copies of H is called an H-matching of G.The maximum cardinality of an H-matching is called the H-matching number of G and is denoted by v(H,G).In this paper we investigate some relations between v(H,G) and signless Laplacian spectrum of G.By a similar discussion we also get some relations between v(H,G) and Laplacian spectrum of G.关键词
图/无符号拉普拉斯谱/子图匹配/拉普拉斯谱Key words
Graph / Signless Laplacian spectrum/ Subgraph matching / Laplacian spectrum分类
数理科学引用本文复制引用
余桂东,叶淼林..子图匹配数与图无符号拉普拉斯谱[J].应用数学,2012,25(3):603-607,5.基金项目
Foundation item:Supported by the NSF of Department of Education of Anhui Province (KJ2011A195),the Innovation Fund for Graduates of Anhui University,and the Anhui Provincial Natural Science Foundation (11040606M14) （KJ2011A195）
