All limit points of the largest roots of matching polynomials are determined
Abstract
The largest matching root μ(G) of a graph G is that of its matching polynomial. In this paper, all limit points of the largest matching roots of graphs are determined. More precisely, we identify the limit points of the largest matching roots of graphs less than τ12+τ-12. For any γ≥ τ12+τ-12 with τ=5+12, there exists a graph sequence \Gi\, |\, i∈ N\ such that i → ∞μ(Gi)=γ.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.