Search Results for ""

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 ...

A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...

A cubic polyhedral graph is a graph that is both cubic and polyhedral. The numbers of cubical polyhedral graphs on n=2, 4, ... nodes are 0, 1, 1, 2, 5, 14, 50, 233, 1249, ... ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

A hyperbolic paraboloid is the quadratic and doubly ruled surface given by the Cartesian equation z=(y^2)/(b^2)-(x^2)/(a^2) (1) (left figure). An alternative form is z=xy (2) ...

The intersection of two lines L_1 and L_2 in two dimensions with, L_1 containing the points (x_1,y_1) and (x_2,y_2), and L_2 containing the points (x_3,y_3) and (x_4,y_4), is ...

The compound of a truncated tetrahedron and its dual, the triakis tetrahedron. The compound can be constructed from a truncated octahedron of unit edge length by midpoint ...

A system for specifying points using coordinates measured in some specified way. The simplest coordinate system consists of coordinate axes oriented perpendicularly to each ...