Minimizing the Laplacian eigenvalues for trees with given domination number

DOI10.1016/j.laa.2006.06.008zbMath1110.05060OpenAlexW2055505555MaRDI QIDQ865427

Guihai Yu, Qiao Li, Li-Hua Feng

Publication date: 14 February 2007

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

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

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 (6)

Some results on Laplacian spectral radius of graphs with cut vertices ⋮ The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number ⋮ Domination number and Laplacian eigenvalue distribution ⋮ Extremal energies of trees with a given domination number ⋮ Bounds on Laplacian eigenvalues related to total and signed domination of graphs ⋮ Maximizing the Laplacian spectral radii of graphs with given diameter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs having domination number half their order
• A note on Laplacian graph eigenvalues
• Laplacian matrices of graphs: A survey
• Extremal graphs for inequalities involving domination parameters
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• On the two conjectures of Graffiti
• Sharp upper bounds for the Laplacian graph eigenvalues
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• On the corona of two graphs
• Domination-balanced graphs

This page was built for publication: Minimizing the Laplacian eigenvalues for trees with given domination number