For every n, all graphs sharing the adjacency spectrum of the double star P_2(1,n) are explicitly described: P_2(1,n) is determined by its spectrum exactly when n is odd or n=2.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A characterization of all graphs cospectral to the double star $P_2(1,n)$
For every n, all graphs sharing the adjacency spectrum of the double star P_2(1,n) are explicitly described: P_2(1,n) is determined by its spectrum exactly when n is odd or n=2.