Search Results for ""

The genus gamma(G) of a graph G is the minimum number of handles that must be added to the plane to embed the graph without any crossings. A graph with genus 0 is embeddable ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...

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 Goddard-Henning graph, illustrated above in several embeddings, is the 9-node planar graph of graph diameter 2 having domination number gamma=3. It was first constructed ...

An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.

The Paulus graphs are the 15 strongly regular graphs on 25 nodes with parameters (nu,k,lambda,mu)=(25,12,5,6) and the 10 strongly regular graphs on 26 nodes with parameters ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

The snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and ...

The great rhombicosidodecahedral graph is the Archimedean graph on 120 vertices and 180 edges that is the skeleton of the great rhombicosidodecahedron as well as the uniform ...

The cyclotomic graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a cube in the finite field GF(q). This graph is ...