Search Results for ""

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 ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The set of graph eigenvalues of the adjacency matrix is called the spectrum of the graph. (But note that in physics, the eigenvalues of the Laplacian matrix of a graph are ...

The Hall graph is a distance-transitive graph on 65 vertices having intersection array {10,6,4,1;1,2,5} (Hall 1980). It is denoted Gamma^((3)) by Hall (1980) and was ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

The m×n king graph 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 king. The number ...