LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
From MaRDI portal
Publication:5324146
DOI10.1142/S1793557109000066zbMath1176.05046MaRDI QIDQ5324146
Xiqin Lin, Guihai Yu, Li-Hua Feng
Publication date: 3 August 2009
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
A lower bound for the algebraic connectivity of a graph in terms of the domination number ⋮ The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
Cites Work
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on graph eigenvalues. I
- Maximum number of edges in connected graphs with a given domination number
- Laplacian matrices of graphs: A survey
- Abschätzungen für die Eigenwerte positiver linearer Operatoren
- The Laplacian Spectrum of a Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER