Minimizing algebraic connectivity over graphs made with some given blocks
From MaRDI portal
Publication:4632255
DOI10.1080/03081087.2018.1438984zbMATH Open1411.05166OpenAlexW2792169227MaRDI QIDQ4632255FDOQ4632255
Authors: D. Kalita, Kuldeep Sarma
Publication date: 29 April 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2018.1438984
Recommendations
- Graphs of given order and size and minimum algebraic connectivity
- On algebraic connectivity of graphs with at most two points of articulation in each block
- The least algebraic connectivity of graphs
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Extremizing algebraic connectivity subject to graph theoretic constraints
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Graph theory with applications
- Minimizing algebraic connectivity over connected graphs with fixed girth
- On algebraic connectivity of graphs with at most two points of articulation in each block
- Title not available (Why is that?)
- Extremizing algebraic connectivity subject to graph theoretic constraints
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Title not available (Why is that?)
- Algebraic connectivity and the characteristic set of a graph
- The minimum algebraic connectivity of caterpillar unicyclic graphs
- Algebraic connectivity of weighted trees under perturbation
- Perron components and algebraic connectivity for weighted graphs
Cited In (5)
- Minimizing algebraic connectivity over connected graphs with fixed girth
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- On algebraic connectivity of graphs with at most two points of articulation in each block
- The algebraic connectivity of barbell graphs
- Graphs of given order and size and minimum algebraic connectivity
This page was built for publication: Minimizing algebraic connectivity over graphs made with some given blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632255)