Signed graphs with eigenvalues > -2 are equivalent to simply laced Dynkin diagrams A_n, D_n, E6, E7, E8, classifying maximal signature checkerboard graph links as isotopic to the diagram realizations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Checkerboard graph links and simply laced Dynkin diagrams
Signed graphs with eigenvalues > -2 are equivalent to simply laced Dynkin diagrams A_n, D_n, E6, E7, E8, classifying maximal signature checkerboard graph links as isotopic to the diagram realizations.