Generalized spectral characterization of signed trees
arXiv:2310.00846
Abstract
Let be a tree with an irreducible characteristic polynomial over . Let be the discriminant of . It is proved that if (which is always an integer) is odd and square free, then every signed tree with underlying graph is determined by its generalized spectrum.