A note on algebraic connectivity of 2-connected graphs
Guanglong Yu, by Shuguang Guo, Lin Sun, Hailiang Zhang, Yarong Wu
TL;DR
This paper identifies the specific 2-connected graphs and theta-graphs that have the lowest algebraic connectivity, providing a complete characterization within these classes.
Contribution
It precisely determines the graphs with minimal algebraic connectivity among all 2-connected graphs and theta-graphs, filling a gap in spectral graph theory.
Findings
Identifies the 2-connected graphs with minimum algebraic connectivity.
Determines the theta-graphs with minimum algebraic connectivity.
Provides a complete characterization within these classes.
Abstract
Among all simple 2-connected graphs, and among all -graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Interconnection Networks and Systems · Graphene research and applications