The smallest values of algebraic connectivity for unicyclic graphs

DOI10.1016/j.dam.2010.05.009zbMath1243.05132OpenAlexW1967663974MaRDI QIDQ602680

Wai Chee Shiu, Ji-Ming Guo, Jian Xi Li

Publication date: 5 November 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.05.009

zbMATH Keywords

orderalgebraic connectivityunicyclic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (7)

Spectral Bounds for the Connectivity of Regular Graphs with Given Order ⋮ The algebraic connectivity of graphs with given circumference ⋮ Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs ⋮ The smallest values of algebraic connectivity for trees ⋮ The algebraic connectivity of lollipop graphs ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ On the intersection of all critical sets of a unicyclic graph

Cites Work

• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• The ordering of unicyclic graphs with the smallest algebraic connectivity
• Laplacian graph eigenvectors
• The ordering of trees and connected graphs by algebraic connectivity
• On the second largest Laplacian eigenvalue of trees
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The smallest values of algebraic connectivity for unicyclic graphs