Search Results for ""

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

The Dürer graph is the skeleton of Dürer's solid, which is the generalized Petersen graph GP(6,2). It is illustrated above in a number of embeddings. It is implemented in the ...

The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...

The Kuratowski reduction theorem states that very nonplanar graph contains either the utility graph UG=K_(3,3) or the pentatope graph K_5 as a graph minor. The graphs K_(3,3) ...

The Schläfli double sixes graph is the Levi graph of the double sixes configuration.

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

The Koolen-Riebeek graph is a weakly regular graph on 486 vertices with parameters (nu,k,lambda,mu)=(486,45,0,(0,9)). It is distance-regular but not distance-transitive with ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...