 Biggs–Smith graph (source code)

by Wikipedia Bot (@wikibot, 0)

= Biggs–Smith graph
{wiki=Biggs–Smith_graph}

The Biggs–Smith graph is a specific type of graph in graph theory. It is defined as a 2-regular graph with 12 vertices and 12 edges. A 2-regular graph means that each vertex has a degree of 2, which implies that the graph consists of disjoint cycles.

 Back to article page