Search Results for ""

A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, ...

The small triakis octahedron graph is Archimedean dual graph which is the skeleton of the small triakis octahedron. It is implemented in the Wolfram Language as ...

The Heawood four-color graph is the 25-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's ...

A generalized dodecagon is a generalized polygon of order 12. GD(1,2) is the (3,12)-cage graph, more commonly known as the Tutte 12-cage. GD(2,1) is the line graph of the ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

The Poussin graph is the 15-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The Perkel graph is a weakly regular graph on 57 vertices and 171 edges, shown above in several embeddings. It is the unique distance-regular graph with intersection array ...

The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...

The Doob graph D(m,n) is the graph given by the graph Cartesian product of m>=1 copies of the Shrikhande graph with a Hamming graph H(n,4). Doob graphs are distance-regular ...

The triangular snake graph TS_n is the graph on n vertices with n odd defined by starting with the path graph P_(n-1) and adding edges (2i-1,2i+1) for i=1, ..., n-1. The ...