Search Results for ""

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

The truncated icosahedral graph is the cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated icosahedron. It is sometimes known as the ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

The m×n queen graph Q_(m,n) is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a queen. ...

The utility problem posits three houses and three utility companies--say, gas, electric, and water--and asks if each utility can be connected to each house without having any ...

The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...

The Reye graph is the transposition graph G_4 of order 4.

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...