TOPICS
Search

Circular Embedding


A circular embedding is a graph embedding in which all graph vertices lie on a common circle, usually arranged so they are equally spaced around the circumference. Specific types of circular embeddings include circulant graph and LCF notation embeddings.

Precomputed planar embeddings of some graphs are available in the Wolfram Language as GraphData[g, "Graph", "Circular"].


See also

Graph Embedding

Explore with Wolfram|Alpha

References

Pemmaraju, S. and Skiena, S. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge, England: Cambridge University Press, 2003.Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990.

Referenced on Wolfram|Alpha

Circular Embedding

Cite this as:

Weisstein, Eric W. "Circular Embedding." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/CircularEmbedding.html

Subject classifications