A lower bound for the algebraic connectivity of a graph in terms of the domination number
From MaRDI portal
Publication:1617025
DOI10.1007/s10255-018-0784-4zbMath1402.05135arXiv1310.8533OpenAlexW2962858064MaRDI QIDQ1617025
Publication date: 7 November 2018
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.8533
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on graph eigenvalues. I
- Old and new results on algebraic connectivity of graphs
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- The algebraic connectivity of graphs under perturbation
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- On graphs having domination number half their order
- Laplacian graph eigenvectors
- The least eigenvalue of signless Laplacian of graphs under perturbation
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- The ordering of trees and connected graphs by algebraic connectivity
- Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number
- Domination-balanced graphs
- Algebraic connectivity of weighted trees under perturbation
- Extremizing algebraic connectivity subject to graph theoretic constraints
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- Algebraic connectivity and the characteristic set of a graph
- LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
- Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs
- Characteristic vertices of trees*
