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

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

• 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?)
• 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
• 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

(23)

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

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)