The ordering of unicyclic graphs with the smallest algebraic connectivity
From MaRDI portal
Publication:1043949
DOI10.1016/J.DISC.2009.01.010zbMATH Open1189.05087OpenAlexW2016558108MaRDI QIDQ1043949FDOQ1043949
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the second largest Laplacian eigenvalue of trees
- Minimizing algebraic connectivity over connected graphs with fixed girth
- Extremizing algebraic connectivity subject to graph theoretic constraints
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- The ordering of trees and connected graphs by algebraic connectivity
- Characteristic vertices of weighted trees via perron values
Cited In (10)
- The algebraic connectivity of graphs with given circumference
- The minimum Laplacian spread of unicyclic graphs
- Maximizing Algebraic Connectivity Over Unicyclic Graphs
- On the Laplacian spectral ratio of connected graphs
- Title not available (Why is that?)
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- The smallest values of algebraic connectivity for unicyclic graphs
- Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles
- Ordering trees and graphs with few cycles by algebraic connectivity
- On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph
This page was built for publication: The ordering of unicyclic graphs with the smallest algebraic connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043949)
