Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane

DOI10.1002/jgt.22913zbMath1522.05082arXiv2202.03965OpenAlexW4312124065MaRDI QIDQ6074574

Sean Dewar

Publication date: 12 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.03965

zbMATH Keywords

distance-regular graphsrigidityedge-transitive graphsglobal rigidity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• There are only finitely many distance-regular graphs of fixed valency greater than two
• The vertex-connectivity of a distance-regular graph
• The distance-regular graphs of valency four
• An algorithm for two-dimensional rigidity percolation: The pebble game
• Connected rigidity matroids and unique realizations of graphs
• Generic global rigidity
• The 2-dimensional rigidity of certain families of graphs
• Characterizing generic global rigidity
• On Generic Rigidity in the Plane
• The Rigidity of Graphs
• Connectivity of transitive graphs

This page was built for publication: Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane