Bounds of Laplacian spectrum of graphs based on the domination number

DOI10.1016/j.laa.2005.01.006zbMath1063.05095OpenAlexW2138253721MaRDI QIDQ556910

Huiqing Liu, Feng Tian, Mei Lu

Publication date: 23 June 2005

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2005.01.006

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (19)

Laplacian spread and some Hamiltonian properties of graphs ⋮ A lower bound for the algebraic connectivity of a graph in terms of the domination number ⋮ Upper bounds on algebraic connectivity via convex optimization ⋮ Bounds on graph eigenvalues. I ⋮ LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER ⋮ Bounds on the (Laplacian) spectral radius of graphs ⋮ The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number ⋮ On the signless Laplacian spectral radius of irregular graphs ⋮ Edge-connectivity and (signless) Laplacian eigenvalue of graphs ⋮ Learning bounds via sample width for classifiers on finite metric spaces ⋮ Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number ⋮ A note on Laplacian eigenvalues and domination ⋮ Unnamed Item ⋮ A sharp upper bound on algebraic connectivity using domination number ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity ⋮ Bounds on Laplacian eigenvalues related to total and signed domination of graphs ⋮ Domination and Spectral Graph Theory ⋮ Signed (total) domination numbers and Laplacian spectrum of graphs ⋮ Bounds for the Laplacian spectral radius of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Laplacian graph eigenvalues
• On the Laplacian eigenvalues of a graph
• Laplacian matrices of graphs: A survey
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• On graphs with algebraic connectivity equal to minimum edge density
• An always nontrivial upper bound for Laplacian graph eigenvalues
• Interlacing eigenvalues and graphs
• Domination in graphs with minimum degree two
• The Laplacian Spectrum of a Graph II
• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
• Characteristic vertices of trees^*

This page was built for publication: Bounds of Laplacian spectrum of graphs based on the domination number