Domination and Spectral Graph Theory

DOI10.1007/978-3-030-58892-2_9zbMath1479.05278OpenAlexW3159874478MaRDI QIDQ3384115

David P. Jacobs, Carlos Hoppen, 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

zbMATH Keywords

signed domination numberdomination numbertotal domination number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The domination number and the least \(Q\)-eigenvalue
• Eigenvalue location for chain graphs
• Efficient domination through eigenvalues
• On the distribution of Laplacian eigenvalues of trees
• Two Laplacians for the distance matrix of a graph
• The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
• Minimal energies of trees with given parameters
• On the number of Laplacian eigenvalues of trees smaller than two
• Extremal energies of trees with a given domination number
• Bounds of Laplacian spectrum of graphs based on the domination number
• Locating the eigenvalues of trees
• On the distribution of Laplacian eigenvalues of a graph
• Spectra of graphs
• A sharp upper bound on the least signless Laplacian eigenvalue using domination number
• Bounds on graph eigenvalues. I
• Domination number and Laplacian eigenvalue distribution
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• A sharp upper bound on algebraic connectivity using domination number
• Bounds and conjectures for the signless Laplacian index of graphs
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Eigenvalue location in graphs of small clique-width
• Laplacian distribution and domination
• Eigenvalue location in cographs
• The least eigenvalue of a graph with a given domination number
• On distance spectral radius of graphs
• Eigenvalue location in threshold graphs
• Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
• A note on Laplacian eigenvalues and domination
• On the spectral radius of graphs with a given domination number
• Diffusion maps
• Bounds on Laplacian eigenvalues related to total and signed domination of graphs
• A note about cospectral graphs for the adjacency and normalized Laplacian matrices
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Towards a theory of domination in graphs
• The Laplacian Spectrum of a Graph II
• Dominating Sets and Eigenvalues of Graphs
• Towards a spectral theory of graphs based on the signless Laplacian, III
• Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
• On distance Laplacian and distance signless Laplacian eigenvalues of graphs
• Graph-Theoretical Matrices in Chemistry
• On the Addressing Problem for Loop Switching

This page was built for publication: Domination and Spectral Graph Theory