A sharp upper bound on the least signless Laplacian eigenvalue using domination number
DOI10.1007/S00373-013-1330-ZzbMATH Open1298.05203OpenAlexW2025895703MaRDI QIDQ742633FDOQ742633
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
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenvalue bounds for the signless laplacian
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Domination-balanced graphs
- Title not available (Why is that?)
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- Domination in graphs of minimum degree five
- Upper bounds on the domination number of a graph in terms of order and minimum degree.
- On graphs having domination number half their order
- A sharp upper bound on algebraic connectivity using domination number
Cited In (3)
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)
