Least $Q$-eigenvalues of nonbipartite 2-connected graphs
Guanglong Yu, by Lin Sun, Chao Yan, Yarong Wu, Hailiang Zhang
TL;DR
This paper determines the minimum least $Q$-eigenvalues for all simple nonbipartite 2-connected graphs and for nonbipartite $ heta$-graphs, providing exact values and classifications.
Contribution
It completely characterizes the least $Q$-eigenvalues for these classes of nonbipartite graphs, filling a gap in spectral graph theory.
Findings
Minimum least $Q$-eigenvalues identified for all simple nonbipartite 2-connected graphs.
Minimum least $Q$-eigenvalues identified for nonbipartite $ heta$-graphs.
Explicit classifications and values provided.
Abstract
Among all simple nonbipartite 2-connected graphs and among all nonbipartite -graphs, the minimum least -eigenvalues 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 · Synthesis and Properties of Aromatic Compounds · Finite Group Theory Research