Search Results for ""

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...

The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

The Games graph is a strongly regular graph on 729 vertices with parameters (nu,k,lambda,mu)=(729,112,1,20). It is distance-regular but not distance-transitive with ...

A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...

A Moore graph of type (v,g) is a regular graph of vertex degree v>2 and girth g that contains the maximum possible number of nodes, namely ...