Algebraic connectivity of connected graphs with fixed number of pendant vertices
From MaRDI portal
Publication:659677
DOI10.1007/s00373-010-0975-0zbMath1235.05089arXiv1003.4646MaRDI 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
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C40: Connectivity
Related Items
Minimizing algebraic connectivity over graphs made with some given blocks, Hamiltonian graphs of given order and minimum algebraic connectivity, On the spectral gap of a quantum graph, On the distance Laplacian spectra of graphs, Trees with matrix weights: Laplacian matrix and characteristic-like vertices, Ordering trees and graphs with few cycles by algebraic connectivity, First eigenvalue of nonsingular mixed graphs with given number of pendant vertices, The algebraic connectivity of graphs with given matching number
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*
