Generalized spectral characterization of signed trees
Abstract
Let T be a tree with an irreducible characteristic polynomial φ(x) over Q. Let (T) be the discriminant of φ(x). It is proved that if 2- n2(T) (which is always an integer) is odd and square free, then every signed tree with underlying graph T is determined by its generalized spectrum.
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.