Expand description
Small graph collection for testing and benchmarking.
This module provides a collection of well-known small graphs commonly used in graph theory. The graphs are equivalent to those in Graphs.jl’s smallgraph function.
All edges are 0-indexed (converted from Julia’s 1-indexed representation).
Functions§
- available_
graphs - List all available small graph names.
- bull
- Returns the edges of the Bull graph. 5 vertices, 5 edges. The bull graph is a triangle with two pendant edges.
- chvatal
- Returns the edges of the Chvátal graph. 12 vertices, 24 edges. The Chvátal graph is the smallest triangle-free graph that is 4-chromatic and 4-regular.
- cubical
- Returns the edges of the Cubical graph (3-cube, Q3). 8 vertices, 12 edges.
- desargues
- Returns the edges of the Desargues graph. 20 vertices, 30 edges.
- diamond
- Returns the edges of the Diamond graph. 4 vertices, 5 edges. The diamond graph is K4 minus one edge.
- dodecahedral
- Returns the edges of the Dodecahedral graph. 20 vertices, 30 edges.
- frucht
- Returns the edges of the Frucht graph. 12 vertices, 18 edges. The Frucht graph is the smallest cubic graph with no non-trivial automorphisms.
- heawood
- Returns the edges of the Heawood graph. 14 vertices, 21 edges. The Heawood graph is a cage and the incidence graph of the Fano plane.
- house
- Returns the edges of the House graph. 5 vertices, 6 edges. The house graph is a square with a triangle on top.
- housex
- Returns the edges of the House X graph. 5 vertices, 8 edges. The house graph with both diagonals of the square.
- icosahedral
- Returns the edges of the Icosahedral graph. 12 vertices, 30 edges.
- karate
- Returns the edges of Zachary’s Karate Club graph. 34 vertices, 78 edges. A social network of a karate club.
- krackhardtkite
- Returns the edges of the Krackhardt Kite graph. 10 vertices, 18 edges.
- moebiuskantor
- Returns the edges of the Möbius-Kantor graph. 16 vertices, 24 edges.
- octahedral
- Returns the edges of the Octahedral graph. 6 vertices, 12 edges.
- pappus
- Returns the edges of the Pappus graph. 18 vertices, 27 edges.
- petersen
- Returns the edges of the Petersen graph. 10 vertices, 15 edges. A well-known graph that is 3-regular and has many interesting properties.
- sedgewickmaze
- Returns the edges of the Sedgewick Maze graph. 8 vertices, 10 edges.
- smallgraph
- Get a small graph by name.
- tetrahedral
- Returns the edges of the Tetrahedral graph (K4). 4 vertices, 6 edges.
- truncatedcube
- Returns the edges of the Truncated Cube graph. 24 vertices, 36 edges.
- truncatedtetrahedron
- Returns the edges of the Truncated Tetrahedron graph. 12 vertices, 18 edges.
- tutte
- Returns the edges of the Tutte graph. 46 vertices, 69 edges. A 3-regular graph that is not Hamiltonian.