Generalized spectral characterization of signed trees
Combinatorics
2023-10-03 v1
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.
Keywords
Cite
@article{arxiv.2310.00846,
title = {Generalized spectral characterization of signed trees},
author = {Yizhe Ji and Wei Wang and Hao Zhang},
journal= {arXiv preprint arXiv:2310.00846},
year = {2023}
}