Signed graphs cospectral with the path
Abstract
A signed graph is said to be determined by its spectrum if every signed graph with the same spectrum as is switching isomorphic with . Here it is proved that the path Pn, interpreted as a signed graph, is determined by its spectrum if and only if n 0, 1, or 2 (mod 4), unless n∈\8, 13, 14, 17, 29\, or n=3.
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.