The packing number and Laplacian spectrum of a graph

DOI10.1080/00207160.2013.846471MaRDI QIDQ2935367zbMATH OpenOpenAlexFDO

Authors Fei Wen, Zhenzhen Lou, Qiongxiang 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) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the packing numbers in graphs
• On packing and covering numbers of graphs
• Packing constants in graphs and connectivity
• Publication:4940073
• Laplacian spectra and chromatic numbers of graphs
• scientific article; zbMATH DE number 867649
• scientific article; zbMATH DE number 1022391
• Packings in complete graphs
• Two theorems on packings of graphs
• Labeled packings of graphs

Cites work

• An introduction to the theory of graph spectra
• Graph theory with applications
• Subgraphs and the Laplacian spectrum of a graph
• The Laplacian Spectrum of a Graph
• The Laplacian spectrum of a graph

Cited in

(4)

• Subgraphs and the Laplacian spectrum of a graph
• The number of triangular packings of a vertex labelled graph on a torus
• Incidence dimension and 2-packing number in graphs
• Euler index of uncertain random graph: concepts and properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935367)