Algebraic connectivity of connected graphs with fixed number of pendant vertices
From MaRDI portal
Publication:659677
DOI10.1007/s00373-010-0975-0zbMath1235.05089arXiv1003.4646OpenAlexW1976232023MaRDI QIDQ659677
Binod Kumar Sahoo, Kamal Lochan Patra, Arbind Kumar Lal
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.4646
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)
Related Items (8)
Trees with matrix weights: Laplacian matrix and characteristic-like vertices ⋮ On the spectral gap of a quantum graph ⋮ The algebraic connectivity of graphs with given matching number ⋮ On the distance Laplacian spectra of graphs ⋮ Minimizing algebraic connectivity over graphs made with some given blocks ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity ⋮ First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Laplacian matrices of graphs: A survey
- Minimizing algebraic connectivity over connected graphs with fixed girth
- 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
- Characteristic vertices of weighted trees via perron values
- The Laplacian Spectrum of a Graph
- Maximizing the distance between center, centroid and characteristic set of a tree
- Perron components and algebraic connectivity for weighted graphs
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Maximizing Algebraic Connectivity Over Unicyclic Graphs
- Algebraic connectivity and the characteristic set of a graph
- Characteristic vertices of trees*
This page was built for publication: Algebraic connectivity of connected graphs with fixed number of pendant vertices