LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
From MaRDI portal
Recommendations
- The k-domination number and bounds for the Laplacian eigenvalues of graphs
- scientific article; zbMATH DE number 907925
- scientific article; zbMATH DE number 5283261
- On the Laplacian eigenvalues of a graph
- Some results for the Laplacian eigenvalues of graphs
- Domination number and Laplacian eigenvalue distribution
- A note on Laplacian graph eigenvalues
- An eigenvalue bound for the Laplacian of a graph
- Eigenvalues of the Laplacian of a graph∗
- The Laplacian eigenvalues and invariants of graphs
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- Abschätzungen für die Eigenwerte positiver linearer Operatoren
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on graph eigenvalues. I
- Graph theory with applications
- Laplacian matrices of graphs: A survey
- Maximum number of edges in connected graphs with a given domination number
- The Laplacian Spectrum of a Graph
Cited in
(18)- A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
- Bounds of Laplacian spectrum of graphs based on the domination number
- Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
- Bounds on graph eigenvalues. I
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
- The least eigenvalue of a graph with a given domination number
- Domination and spectral graph theory
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- A sharp upper bound on the least signless Laplacian eigenvalue using domination number
- Some results on the A α -eigenvalues of a graph
- On the spectral radius of graphs with a given domination number
- A sharp upper bound on algebraic connectivity using domination number
- Laplacian eigenvalues and partition problems in hypergraphs
- Domination number and Laplacian eigenvalue distribution
- Laplacian distribution and domination
- Permanental bounds of the Laplacian matrix of trees with given domination number
- The k-domination number and bounds for the Laplacian eigenvalues of graphs
- A note on Laplacian eigenvalues and domination
This page was built for publication: LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5324146)