Search Results for ""

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The Hatzel graph is a planar hypohamiltonian graph on 57 vertices that was the smallest known example of such a graph until the discovery of the Zamfirescu graph on 48 ...

The Pell graph Pi_n is the graph defined as follows. Consider n-tuples of (0,1,2) such that maximal blocks of an odd number of 2's are forbidden. Take these as the vertices ...