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

DOI10.1007/S00373-013-1330-ZMaRDI QIDQ742633zbMATH OpenOpenAlexFDO

Authors Changxiang 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

least eigenvaluesignless Laplaciangraph spectra

Mathematics Subject Classification ID

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

Recommendations

• The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
• Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
• LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
• The least eigenvalue of a graph with a given domination number
• A sharp lower bound on the least signless Laplacian eigenvalue of a graph

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3531438 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• 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
• Domination in graphs of minimum degree five
• Domination-balanced graphs
• Eigenvalue bounds for the signless laplacian
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• On graphs having domination number half their order
• Upper bounds on the domination number of a graph in terms of order and minimum degree.

Cited in

(3)

• Domination and spectral graph theory
• Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
• A discrete nodal domain theorem for trees

This page was built for publication: A sharp upper bound on the least signless Laplacian eigenvalue using domination number

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