子图匹配数与图无符号拉普拉斯谱(英文)

Subgraphs Matching Number and Signless Laplacian Spectra of Graphs

设H是图G的一个子图.图G中同构于H的点不交的子图构成的集合称为G的一个H-匹配.图G的H-匹配的最大基数称为是G的H-匹配数,记为ν(H,G).本文主要研究ν(H,G)与G的无符号拉普拉斯谱的关系,同时也讨论了ν(H,G)与G的拉普拉斯谱的关系.

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 in- vestigate some relations between v（H,G） and signless Laplacian spectrum of G. By a similar discus- sion we also get some relations between v（H,G） and Laplacian spectrum of G.