The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
From MaRDI portal
Publication:2469512
DOI10.1016/j.laa.2007.08.018zbMath1136.05012OpenAlexW2012871268MaRDI QIDQ2469512
Kamal Lochan Patra, Arbind Kumar Lal
Publication date: 6 February 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.08.018
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (11)
A lower bound for the algebraic connectivity of a graph in terms of the domination number ⋮ On algebraic connectivity of graphs with at most two points of articulation in each block ⋮ Trees with matrix weights: Laplacian matrix and characteristic-like vertices ⋮ Unnamed Item ⋮ Algebraic connectivity of connected graphs with fixed number of pendant vertices ⋮ On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\) ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Some results on the Laplacian spectrum ⋮ The algebraic connectivity of graphs under perturbation ⋮ ALGEBRAIC CONNECTIVITY OF WEIGHED GRAPHS UNDER SHIFTING COMPONENTS ⋮ On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Laplacian matrices of graphs: A survey
- Characteristic vertices of weighted trees via perron values
- The Laplacian Spectrum of a Graph
- Eigenvectors of acyclic matrices
- Perron components and algebraic connectivity for weighted graphs
- Algebraic connectivity of weighted trees under perturbation
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Algebraic connectivity and the characteristic set of a graph
This page was built for publication: The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
