Graphs with few matching roots
Abstract
We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.
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.