05924517

j

05924517 Teranishi, Yasuo Subgraphs and the Laplacian spectrum of a graph. Linear Algebra Appl. 435, No. 5, 1029-1033 (2011). 2011 Elsevier Science Inc. (North-Holland), New York, NY EN graph spectra Laplacian matrix tree

doi:10.1016/j.laa.2011.02.019

Summary: 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 $H$ is called an $H$-matching. Denoting by $\nu (H,G)$ the cardinality of a maximum $H$-matching in $G$, we investigate some relations between $\nu (H,G)$ and the Laplacian spectrum of $G$.