Least Q-eigenvalues of nonbipartite 2-connected graphs

2019/11/28 by Guanglong Yu, by Lin Sun, Lin Sun +8
Chemistry · Mathematics · #05C50 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #G.2.2 #Graph theory and applications #Synthesis and Properties of Aromatic Compounds #acm:05C50 #math.CO #msc:05C50

paper · pdf · doi:10.48550/arxiv.1911.12541

arxiv created 2019/11/28 · openalex publication_date 2019/11/28 · arxiv updated 2019/12/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Among all simple nonbipartite 2-connected graphs and among all nonbipartite θ-graphs, the minimum least Q-eigenvalues are completely determined, respectively.

Related

• Further results on the least Q-eigenvalue of a graph with fixed domination number
• A lower bound of the least signless Laplacian eigenvalue of a graph
• The least eigenvalue of the complements of graphs with given connectivity
• The smallest eigenvalue of K_p-free graphs
• On Graphs with the Smallest Eigenvalue at Least -1-√(2), part II