Unit-Distance Embedding

A unit-distance embedding is a graph embedding in which all edges have unit length.

A graph possessing a unit-distance embedding in two dimensions is called a unit-distance graph.

A unit-distance graph is a special case of an integral embedding.

A graph possessing an embedding that is both unit-distance in two dimensions and planar is known as a matchstick graph.

See also

Graph Embedding, Integral Embedding, Matchstick Graph, Unit-Distance Graph

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Unit-Distance Embedding." From MathWorld--A Wolfram Web Resource.

Subject classifications