Search Results for ""

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...

The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...

The twinplex graph is the graph illustrated above in a number of embeddings which corresponds to the graph labeled Gamma_2 in Fischer and Little (2011). It is a cubic ...

The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial pi_(theta_0)(z)=z^7-8z^6+28z^5-56z^4+68z^3-47z^2+14z and chromatic ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

The Knödel graph W_(Delta,n) is a regular bipartite graph of vertex degree Delta on n nodes for even n>=2 and 1<=Delta<=|_log_2n_| with edges defined as follows. Label the ...

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...