Search Results for ""
641 - 650 of 2496 for Simple GraphSearch Results
Tutte's fragment (Taylor 1997) is the 15-node graph illustrated above (Grünbaum 2003, pp. 358-359 and Fig. 17.1.3). If the graph obtained by adding pendant edges to corners ...
The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...
The Moser spindle is the 7-node unit-distance graph illustrated above (Read and Wilson 1998, p. 187). It is sometimes called the Hajós graph (e.g., Bondy and Murty 2008. p. ...
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 Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...
The mathematical study of the properties of the formal mathematical structures called graphs.
The Balaban 10-cage is one of the three (3,10)-cage graphs (Read and Wilson 1998, p. 272). The Balaban (3,10)-cage was the first known example of a 10-cage (Balaban 1973, ...
A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...
Grinberg constructed a number of small cubic polyhedral graph that are counterexamples to Tait's Hamiltonian graph conjecture (i.e., that every 3-connected cubic graph is ...
There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...
...
View search results from all Wolfram sites (39665 matches)

