Search Results for ""

The (m,n)-windmill graph is the graph obtained by taking m copies of the complete graph K_n with a vertex in common (Gallian 2011, p. 16). The (m,n)-windmill graph is ...

The rhombic dodecahedral graph is the Archimedean dual graph which is the skeleton of the rhombic dodecahedron (as well as the Bilinski dodecahedron). It is the Levi graph of ...

The Soifer graph, illustrated above in a number of embeddings, is a planar graph on 9 nodes that tangles the Kempe chains in Kempe's algorithm and thus provides an example of ...

The rhombicosahedral graph, illustrated above, is the skeleton of the icosidodecadodecahedron, rhombicosahedron and rhombidodecadodecahedron. It will be implemented in a ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three ...

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

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...

The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...