|
SOLUTIONS
|
-
Functions
- ButterflyGraph
- CageGraph
- ChvatalGraph
- CirculantGraph
- CompleteGraph
- CompleteKPartiteGraph
- CoxeterGraph
- CubeConnectedCycle
- CubicalGraph
- Cycle
- DeBruijnGraph
- DodecahedralGraph
- EmptyGraph
- FolkmanGraph
- FranklinGraph
- FruchtGraph
- GeneralizedPetersenGraph
- GrayGraph
- GridGraph
- GroetzschGraph
- Harary
- HeawoodGraph
- HerschelGraph
- Hypercube
- IcosahedralGraph
- KnightsTourGraph
- LeviGraph
- McGeeGraph
- MeredithGraph
- MycielskiGraph
- NoPerfectMatchingGraph
- OctahedralGraph
- OddGraph
- PetersenGraph
- RandomGraph
- RobertsonGraph
- ShuffleExchangeGraph
- Star
- TetrahedralGraph
- ThomassenGraph
- Turan
- TutteGraph
- Uniquely3ColorableGraph
- UnitransitiveGraph
- WaltherGraph
- Wheel
- Related Guides
- Tutorials
Built-in Graphs
ReferenceReference
CompleteGraph — a graph with an edge between each pair of vertices
RandomGraph — construct a random graph
EmptyGraph ▪ OddGraph ▪ CirculantGraph ▪ CompleteKPartiteGraph ▪ Turan
Cycle — a circular chain of edges
Star — a tree-like graph with one vertex connected to all others
GridGraph — graph with nodes on a grid
Wheel ▪ Hypercube ▪ ButterflyGraph ▪ ShuffleExchangeGraph ▪ DeBruijnGraph
Special Graphs
Harary — smallest
-connected graph with
vertices
TutteGraph — example of non-Hamiltonian graph
PetersenGraph ▪ GeneralizedPetersenGraph ▪ CageGraph
MeredithGraph ▪ NoPerfectMatchingGraph ▪ ThomassenGraph
KnightsTourGraph ▪ ChvatalGraph ▪ CoxeterGraph ▪ FolkmanGraph
FranklinGraph ▪ FruchtGraph ▪ GrayGraph ▪ GroetzschGraph
HerschelGraph ▪ HeawoodGraph ▪ LeviGraph ▪ McGeeGraph ▪ RobertsonGraph
UnitransitiveGraph ▪ Uniquely3ColorableGraph ▪ WaltherGraph
CubeConnectedCycle ▪ MycielskiGraph
