Search Results for ""

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...

An ambient isotopy from an embedding of a manifold M in N to another is a homotopy of self diffeomorphisms (or isomorphisms, or piecewise-linear transformations, etc.) of N, ...

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...

The "echidnahedron" is the term for the spiky fourth icosahedron stellation (in the enumeration of Maeder 1994) apparently first used in the Netlib polyhedron database. It is ...

A heptahedron is a polyhedron with seven faces. Because there are 34 heptahedral graphs, there are 34 topologically distinct convex heptahedra. There are three semiregular ...

The metabiaugmented dodecahedron is a convex equilateral solid that is Johnson solid J_(60). The unit metabiaugmented dodecahedron has volume V=1/6(25+11sqrt(5)) (1) and Dehn ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...