Least Q-eigenvalues of nonbipartite 2-connected graphs
Abstract
Among all simple nonbipartite 2-connected graphs and among all nonbipartite θ-graphs, the minimum least Q-eigenvalues are completely determined, respectively.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.