A conjecture on the algebraic connectivity of connected graphs with fixed girth
From MaRDI portal
Publication:998451
DOI10.1016/j.disc.2007.10.044zbMath1189.05085OpenAlexW2050126923WikidataQ123115020 ScholiaQ123115020MaRDI QIDQ998451
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.044
Related Items (19)
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 ⋮ The algebraic connectivity of graphs with given circumference ⋮ Laplacian spectral characterization of dumbbell graphs and theta graphs ⋮ Laplacian spectral characterization of clover graphs ⋮ Signless Laplacian spectral characterization of line graphs ofT-shape trees ⋮ The smallest values of algebraic connectivity for unicyclic graphs ⋮ The smallest values of algebraic connectivity for trees ⋮ Signless Laplacian spectral characterization of 4-rose graphs ⋮ The algebraic connectivity of lollipop graphs ⋮ Algebraic connectivity of connected graphs with fixed number of pendant vertices ⋮ Minimizing algebraic connectivity over graphs made with some given blocks ⋮ On limit points of Laplacian spectral radii of graphs ⋮ On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Surgery principles for the spectral analysis of quantum graphs ⋮ The ordering of unicyclic graphs with the smallest algebraic connectivity ⋮ Spectral characterizations of signed lollipop graphs ⋮ First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Old and new results on algebraic connectivity of graphs
- 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
- Eigenvalues of the Laplacian of a graph∗
- 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: A conjecture on the algebraic connectivity of connected graphs with fixed girth