TOPICS
Search

Folkman Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook
FolkmanGraph

The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as GraphData["FolkmanGraph"] and illustrated above in several symmetric embeddings.

FolkmanGraphLCF

The Folkman graph has eight distinct generalized LCF notations, three with exponent 5 and five with exponent 1, illustrated above.

The Folkman graph has graph spectrum

(-4)^1(-sqrt(6))^40^(10)(sqrt(6))^44^1.

See also

Edge-Transitive Graph, Gray Graph, Semisymmetric Graph, Symmetric Graph, Vertex-Transitive Graph

Explore with Wolfram|Alpha

References

Bondy, J. A. and Murty, U. S. R. Graph Theory with Applications. New York: North Holland, p. 235, 1976.Folkman, J. "Regular Line-Symmetric Graphs." J. Combin. Th. 3, 215-232, 1967.Godsil, C. and Royle, G. Algebraic Graph Theory. New York: Springer-Verlag, p. 36, 2001.Pisanski, T. and Randić, M. "Bridges between Geometry and Graph Theory." In Geometry at Work: A Collection of Papers Showing Applications of Geometry (Ed. C. A. Gorini). Washington, DC: Math. Assoc. Amer., pp. 174-194, 2000.Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 186-187, 1990.

Referenced on Wolfram|Alpha

Folkman Graph

Cite this as:

Weisstein, Eric W. "Folkman Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/FolkmanGraph.html

Subject classifications