Domination and spectral graph theory
From MaRDI portal
Publication:3384115
DOI10.1007/978-3-030-58892-2_9zbMATH Open1479.05278OpenAlexW3159874478MaRDI QIDQ3384115FDOQ3384115
Authors: Carlos Hoppen, David P. Jacobs, Vilmar Trevisan
Publication date: 14 December 2021
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_9
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Diffusion maps
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Title not available (Why is that?)
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- The Laplacian Spectrum of a Graph II
- Title not available (Why is that?)
- Spectra of graphs
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- On the Addressing Problem for Loop Switching
- On distance spectral radius of graphs
- Two Laplacians for the distance matrix of a graph
- Title not available (Why is that?)
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Bounds and conjectures for the signless Laplacian index of graphs
- The domination number and the least \(Q\)-eigenvalue
- Title not available (Why is that?)
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Towards a theory of domination in graphs
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
- Eigenvalue location in threshold graphs
- Eigenvalue location for chain graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the distribution of Laplacian eigenvalues of trees
- Efficient domination through eigenvalues
- Dominating Sets and Eigenvalues of Graphs
- Title not available (Why is that?)
- Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
- Title not available (Why is that?)
- Locating the eigenvalues of trees
- On distance Laplacian and distance signless Laplacian eigenvalues of graphs
- Title not available (Why is that?)
- Minimal energies of trees with given parameters
- On the distribution of Laplacian eigenvalues of a graph
- The least eigenvalue of a graph with a given domination number
- On the spectral radius of graphs with a given domination number
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on graph eigenvalues. I
- Title not available (Why is that?)
- Extremal energies of trees with a given domination number
- Spectral radius of graphs
- Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
- On the number of Laplacian eigenvalues of trees smaller than two
- Eigenvalue location in cographs
- A sharp upper bound on the least signless Laplacian eigenvalue using domination number
- A sharp upper bound on algebraic connectivity using domination number
- Domination number and Laplacian eigenvalue distribution
- Title not available (Why is that?)
- Laplacian distribution and domination
- A note on Laplacian eigenvalues and domination
- Eigenvalue location in graphs of small clique-width
- Graph-Theoretical Matrices in Chemistry
- Bounds on Laplacian eigenvalues related to total and signed domination of graphs.
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)