A graph is totally conformally rigid if and only if it is edge-rigid (every canonical spectral embedding onto a Laplacian eigenspace is edge-isometric), which is equivalent to all edges being pairwise Laplacian-cospectral, enabling a polynomial-time decision algorithm via SDP duality.
On a theorem of Weyl concerning eigenvalues of linear transformations I
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Total Conformal Rigidity in Graphs
A graph is totally conformally rigid if and only if it is edge-rigid (every canonical spectral embedding onto a Laplacian eigenspace is edge-isometric), which is equivalent to all edges being pairwise Laplacian-cospectral, enabling a polynomial-time decision algorithm via SDP duality.