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.
Attainable bounds for algebraic connectivity and maximally connected regular graphs
1 Pith paper cite this work, alongside 3 external citations. Polarity classification is still indexing.
1
Pith paper citing it
3
external citations · Crossref
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.