| 子图匹配数与图无符号拉普拉斯谱(英文) |
| |
| 引用本文： | 余桂东,叶淼林.子图匹配数与图无符号拉普拉斯谱(英文)[J].应用数学,2012,25(3):603-607. |
| |
| 作者姓名： | 余桂东 叶淼林 |
| |
| 作者单位： | 1. 安徽大学数学科学学院,安徽合肥230039;安庆师范学院数学与计算科学学院,安徽安庆246011
2. 安庆师范学院数学与计算科学学院,安徽安庆,246011 |
| |
| 基金项目： | Supported by the NSF of Department of Education of Anhui Province(KJ2011A195);the Innovation Fund for Graduates of Anhui University;the Anhui Provincial Natural Science Foundation(11040606M14) |
| |
| 摘 要： | 设H是图G的一个子图.图G中同构于H的点不交的子图构成的集合称为G的一个H-匹配.图G的H-匹配的最大基数称为是G的H-匹配数,记为ν(H,G).本文主要研究ν(H,G)与G的无符号拉普拉斯谱的关系,同时也讨论了ν(H,G)与G的拉普拉斯谱的关系.
|
| 关 键 词： | 图 无符号拉普拉斯谱 子图匹配 拉普拉斯谱 |
Subgraphs Matching Number and Signless Laplacian Spectra of Graphs |
| |
| YU Guidong
,
YE Miaolin.Subgraphs Matching Number and Signless Laplacian Spectra of Graphs[J].Mathematica Applicata,2012,25(3):603-607. |
| |
| Authors: | YU Guidong YE Miaolin |
| |
| Institution: | 1.School of Mathematical Sciences,Anhui University,Hefei 230039,China;2.School of Mathematics & Computation Sciences,Anqing Normal College,Anqing 246011,China) |
| |
| 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 ν(H,G).In this paper we investigate some relations between ν(H,G) and signless Laplacian spectrum of G.By a similar discussion we also get some relations between ν(H,G) and Laplacian spectrum of G. |
| |
| Keywords: | Graph Signless Laplacian spectrum Subgraph matching Laplacian spectrum |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
