The packing number and Laplacian spectrum of a graph

DOI10.1080/00207160.2013.846471zbMath1305.05135OpenAlexW2044490858MaRDI QIDQ2935367

Fei Wen, Zhenzhen Lou, Qiong Xiang Huang

Publication date: 29 December 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.846471

zbMATH Keywords

lower boundLaplacian spectrumpacking numberperfect subgraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Euler index of uncertain random graph: concepts and properties

Cites Work

• Unnamed Item
• Unnamed Item
• Subgraphs and the Laplacian spectrum of a graph
• The Laplacian spectrum of a graph
• The Laplacian Spectrum of a Graph

This page was built for publication: The packing number and Laplacian spectrum of a graph