Bounds of Laplacian spectrum of graphs based on the domination number

DOI10.1016/J.LAA.2005.01.006MaRDI QIDQ556910zbMATH OpenOpenAlexFDO

Authors Huiqing Liu, Mei Lu, Feng Tian

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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
• LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
• A sharp upper bound on algebraic connectivity using domination number
• Domination number and Laplacian eigenvalue distribution
• scientific article; zbMATH DE number 907925

Cites work

• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• A note on Laplacian graph eigenvalues
• An always nontrivial upper bound for Laplacian graph eigenvalues
• Characteristic vertices of trees^*
• Domination in graphs with minimum degree two
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 4114654 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• Laplacian matrices of graphs: A survey
• On graphs with algebraic connectivity equal to minimum edge density
• On the Laplacian eigenvalues of a graph
• The Laplacian Spectrum of a Graph II

Cited in

(26)

• A lower bound for the algebraic connectivity of a graph in terms of the domination number
• On the signless Laplacian spectral radius of irregular graphs
• A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
• 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
• Laplacian spectral bounds for clique and independence numbers of graphs
• Bounds on Laplacian eigenvalues related to total and signed domination of graphs.
• Domination and spectral graph theory
• Laplacian minimum boundary dominating energy of graphs
• Signed (total) domination numbers and Laplacian spectrum of graphs
• The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
• scientific article; zbMATH DE number 907925 (Why is no real title available?)
• Bounds for the Laplacian spectral radius of graphs
• scientific article; zbMATH DE number 7473309 (Why is no real title available?)
• Laplacian spread and some Hamiltonian properties of graphs
• Hamiltonian graphs of given order and minimum algebraic connectivity
• LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
• Some results on the k-alliance and domination of graphs
• The Narumi-Katayama index and some Hamiltonian properties of graphs
• Upper bounds on algebraic connectivity via convex optimization
• Lower bounds of the Laplacian spectrum of graphs based on diameter
• Bounds on graph eigenvalues. I
• Bounds on the (Laplacian) spectral radius of graphs
• A sharp upper bound on algebraic connectivity using domination number

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

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