Search Results for ""

The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10. It is ...

The Tutte 8-cage (Godsil and Royle 2001, p. 59; right figure) is a cubic graph on 30 nodes and 45 edges which is the Levi graph of the Cremona-Richmond configuration. It ...

The n-double cone graph is the name given in the work to the graphs that geometrically correspond to a double cone obtained by connecting all vertices of two C_n cycle graphs ...

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

The Fritsch graph is the 9-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 ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

The Harries graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries-Wong graph. The Harries graph is ...

A cubic nonplanar graph is a graph that is both cubic and nonplanar. The following table summarizes some named nonplanar cubic graphs. graph G |V(G)| utility graph 6 Petersen ...

A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of ...

The Schläfli graph is a strongly regular graph on 27 nodes which is the graph complement of the generalized quadrangle GQ(2,4). It is the unique strongly regular graph with ...