The algebraic connectivity of lollipop graphs
From MaRDI portal
Publication:632471
DOI10.1016/j.laa.2010.12.020zbMath1227.05182OpenAlexW1985017866MaRDI QIDQ632471
Wai Chee Shiu, Ji-Ming Guo, Jian Xi Li
Publication date: 25 March 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.12.020
Trees (05C05) Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (5)
Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles ⋮ 2-connected graphs with the minimum algebraic connectivity ⋮ The algebraic connectivity of graphs with given circumference ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ On minimum algebraic connectivity of graphs whose complements are bicyclic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The smallest values of algebraic connectivity for unicyclic graphs
- The orderings of bicyclic graphs and connected graphs by algebraic connectivity
- Spectral characterizations of lollipop graphs
- The algebraic connectivity of graphs under perturbation
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- The lollipop graph is determined by its \(Q\)-spectrum
- Laplacian graph eigenvectors
- Minimizing algebraic connectivity over connected graphs with fixed girth
- On algebraic connectivity and spectral integral variations of graphs
- On the second largest Laplacian eigenvalue of trees
- Characteristic vertices of weighted trees via perron values
- The Laplacian Spectrum of a Graph
- Matrix Analysis
- Algebraic connectivity of weighted trees under perturbation
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Algebraic connectivity and the characteristic set of a graph
- Characteristic vertices of trees*
- Ordering trees by algebraic connectivity
This page was built for publication: The algebraic connectivity of lollipop graphs
