Domination number and Laplacian eigenvalue distribution
From MaRDI portal
Publication:901155
DOI10.1016/j.ejc.2015.11.005zbMath1328.05141OpenAlexW2193740650MaRDI QIDQ901155
David P. Jacobs, Stephen T. Hedetniemi, Vilmar Trevisan
Publication date: 23 December 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2015.11.005
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (15)
Laplacian distribution and domination ⋮ Classification of trees by Laplacian eigenvalue distribution and edge covering number ⋮ Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond ⋮ Classification of graphs by Laplacian eigenvalue distribution and independence number ⋮ Line graphs of trees with the largest eigenvalue multiplicity ⋮ Signless Laplacian spectrum of a graph ⋮ Most Laplacian eigenvalues of a tree are small ⋮ Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution ⋮ Domination number and Laplacian eigenvalue of trees ⋮ Laplacian eigenvalue distribution and graph parameters ⋮ The least \(Q\)-eigenvalue with fixed domination number ⋮ Domination and Spectral Graph Theory ⋮ On the number of Laplacian eigenvalues of trees less than the average degree ⋮ Open problem on \(\sigma\)-invariant ⋮ A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distribution of Laplacian eigenvalues of trees
- On the number of Laplacian eigenvalues of trees smaller than two
- On the distribution of Laplacian eigenvalues of a graph
- Laplace eigenvalues of graphs---a survey
- Bounds on graph eigenvalues. I
- Minimizing the Laplacian eigenvalues for trees with given domination number
- A sharp upper bound on algebraic connectivity using domination number
- Vertex-disjoint claws in graphs
- Laplacian matrices of graphs: A survey
- The Gewirtz graph: An exercise in the theory of graph spectra
- A note on Laplacian eigenvalues and domination
- Graph-theoretic parameters concerning domination, independence, and irredundance
- The Laplacian Spectrum of a Graph
- Thekth Laplacian eigenvalue of a tree
- Domination in graphs with minimum degree two
- Paths, Stars and the Number Three
- Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
This page was built for publication: Domination number and Laplacian eigenvalue distribution