A sharp upper bound on the least signless Laplacian eigenvalue using domination number

DOI10.1007/s00373-013-1330-zzbMath1298.05203OpenAlexW2025895703MaRDI QIDQ742633

Chang-Xiang He, Min Zhou

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1330-z

zbMATH Keywords

signless Laplacianleast eigenvaluegraph spectra

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings ⋮ Domination and Spectral Graph Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• A sharp upper bound on algebraic connectivity using domination number
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• On graphs having domination number half their order
• Domination in graphs of minimum degree five
• Eigenvalue bounds for the signless laplacian
• Domination-balanced graphs