Paths are generically realisable
Abstract
We show that every 0-1 multiplicity matrix for a simple graph G is generically realisable for G. In particular, every multiplicity matrix for a path is generically realisable. We use this result to provide several families of joins of graphs that are realisable by a matrix with only two distinct eigenvalues.
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.