Almost all graphs of order n have no cospectral mates with height o((n / ln n)^{1/10}).
On a generalization of the johnson-newman theorem to multiple rank-one perturbations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Almost all graphs have no cospectral mates with height relative small to its order
Almost all graphs of order n have no cospectral mates with height o((n / ln n)^{1/10}).