scientific article; zbMATH DE number 907925
From MaRDI portal
Publication:4886769
Recommendations
Cites work
- scientific article; zbMATH DE number 510844 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Eigenvalues of the Laplacian of a graph∗
- Partitioning Sparse Matrices with Eigenvectors of Graphs
Cited in
(18)- Domination and spectral graph theory
- LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
- Laplacian distribution and domination
- Domination number and Laplacian eigenvalue distribution
- The spectral radius and domination number in linear uniform hypergraphs
- A note on Laplacian eigenvalues and domination
- Eigenvalues and separation in graphs
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on graph eigenvalues. I
- Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
- Efficient domination through eigenvalues
- A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
- Eigenvalues and the diameter of graphs
- Eigenvalues and homology of flag complexes and vector representations of graphs
- The \(k\)-domination number and bounds for the Laplacian eigenvalues of graphs
- Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
- Largest eigenvalue of the Laplacian matrix: its eigenspace and transitive orientations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886769)