Algebraic Distance Graphs and Rigidity

DOI10.2307/2001254zbMath0765.05042OpenAlexW4233692713MaRDI QIDQ4712768

No author found.

Publication date: 25 June 1992

Full work available at URL: https://doi.org/10.2307/2001254

zbMATH Keywords

circlerigiditysimplexcomponentscompletepolygonsconnectedflexiblealgebraic distance graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Other problems of combinatorial convexity (52A37) Graph theory (05C99)

Related Items (3)

A few applications of negative-type inequalities ⋮ Distances in a rigid unit-distance graph in the plane ⋮ Extending a flexible unit-bar framework to a rigid one

Cites Work

• Space graphs and sphericity
• On the sphericity and cubicity of graphs
• Colouring the real line
• Unit-distance graphs in rational n-spaces
• Note on induced subgraphs of the unit distance graph \(E^ n\)
• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• The rigidity of graphs. II
• The rigidity of suspensions
• Rigid and Flexible Frameworks
• Singular Points of Complex Hypersurfaces. (AM-61)
• Integral distances
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic Distance Graphs and Rigidity