Circular Embedding
المؤلف:
Pemmaraju, S. and Skiena, S.
المصدر:
Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge, England: Cambridge University Press, 2003.
الجزء والصفحة:
...
5-4-2022
2191
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"].
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.
الاكثر قراءة في نظرية البيان
اخر الاخبار
اخبار العتبة العباسية المقدسة
