A subdifferential framework certifies conformal rigidity via orbit-isometric embeddings, reducing the problem for vertex-transitive graphs to a single-eigenvector check and in general to linear feasibility or Gröbner bases.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 2years
2026 2roles
background 1polarities
background 1representative citing papers
A graph is totally conformally rigid iff every Laplacian eigenspace embedding is edge-isometric, equivalently iff deleting any single edge always leaves the same Laplacian characteristic polynomial.
citing papers explorer
-
Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries
A subdifferential framework certifies conformal rigidity via orbit-isometric embeddings, reducing the problem for vertex-transitive graphs to a single-eigenvector check and in general to linear feasibility or Gröbner bases.
-
Total Conformal Rigidity in Graphs
A graph is totally conformally rigid iff every Laplacian eigenspace embedding is edge-isometric, equivalently iff deleting any single edge always leaves the same Laplacian characteristic polynomial.