The ordering of unicyclic graphs with the smallest algebraic connectivity

DOI10.1016/j.disc.2009.01.010zbMath1189.05087OpenAlexW2016558108MaRDI QIDQ1043949

J. Blot

Publication date: 10 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.01.010

zbMATH Keywords

characteristic polynomialLaplacian matrixalgebraic connectivityunicyclic graphFielder vector

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (7)

Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles ⋮ The algebraic connectivity of graphs with given circumference ⋮ The smallest values of algebraic connectivity for unicyclic graphs ⋮ On the Laplacian spectral ratio of connected graphs ⋮ On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ The minimum Laplacian spread of unicyclic graphs

Cites Work

• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• Minimizing algebraic connectivity over connected graphs with fixed girth
• The ordering of trees and connected graphs by algebraic connectivity
• On the second largest Laplacian eigenvalue of trees
• Characteristic vertices of weighted trees via perron values
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Unnamed Item

This page was built for publication: The ordering of unicyclic graphs with the smallest algebraic connectivity