Domination and spectral graph theory
From MaRDI portal
Publication:3384115
Recommendations
Cites work
- scientific article; zbMATH DE number 3834009 (Why is no real title available?)
- scientific article; zbMATH DE number 6113894 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3627232 (Why is no real title available?)
- scientific article; zbMATH DE number 861417 (Why is no real title available?)
- scientific article; zbMATH DE number 907925 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- A note on Laplacian eigenvalues and domination
- A sharp upper bound on algebraic connectivity using domination number
- A sharp upper bound on the least signless Laplacian eigenvalue using domination number
- Bounds and conjectures for the signless Laplacian index of graphs
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
- Bounds on Laplacian eigenvalues related to total and signed domination of graphs.
- Bounds on graph eigenvalues. I
- Developments on spectral characterizations of graphs
- Diffusion maps
- Dominating Sets and Eigenvalues of Graphs
- Domination number and Laplacian eigenvalue distribution
- Efficient domination through eigenvalues
- Eigenvalue location for chain graphs
- Eigenvalue location in cographs
- Eigenvalue location in graphs of small clique-width
- Eigenvalue location in threshold graphs
- Extremal energies of trees with a given domination number
- Graph-Theoretical Matrices in Chemistry
- Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
- Laplacian distribution and domination
- Locating the eigenvalues of trees
- Minimal energies of trees with given parameters
- On distance Laplacian and distance signless Laplacian eigenvalues of graphs
- On distance spectral radius of graphs
- On the Addressing Problem for Loop Switching
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the distribution of Laplacian eigenvalues of a graph
- On the distribution of Laplacian eigenvalues of trees
- On the number of Laplacian eigenvalues of trees smaller than two
- On the spectral radius of graphs with a given domination number
- Spectra of graphs
- Spectral radius of graphs
- The Laplacian Spectrum of a Graph II
- The domination number and the least \(Q\)-eigenvalue
- The least eigenvalue of a graph with a given domination number
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Towards a theory of domination in graphs
- Two Laplacians for the distance matrix of a graph
- Which graphs are determined by their spectrum?
This page was built for publication: Domination and spectral graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384115)
