A signed bipartite graph with a squarefree half-discriminant and a plus or minus one constant or linear coefficient is determined by its generalized spectrum whenever it is controllable or almost controllable.
Schwenk, Almost all trees are cospectral, in: F
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
-
Generalized spectral characterization of signed bipartite graphs
A signed bipartite graph with a squarefree half-discriminant and a plus or minus one constant or linear coefficient is determined by its generalized spectrum whenever it is controllable or almost controllable.