Search Results for ""

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

The cross polytope beta_n is the regular polytope in n dimensions corresponding to the convex hull of the points formed by permuting the coordinates (+/-1, 0, 0, ..., 0). A ...

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...

A cubic semisymmetric graph is a graph that is both cubic (i.e., regular of degree 3) and semisymmetric (i.e., edge- but not vertex-transitive). The four smallest cubic ...

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest ...

An n-gonal cupola Q_n is a polyhedron having n obliquely oriented triangular and n rectangular faces separating an {n} and a {2n} regular polygon, each oriented horizontally. ...

A cyclic pentagon is a not necessarily regular pentagon on whose polygon vertices a circle may be circumscribed. Let such a pentagon have edge lengths a_1, ..., a_5, and area ...

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 developable surface, also called a flat surface (Gray et al. 2006, p. 437), is a ruled surface having Gaussian curvature K=0 everywhere. Developable surfaces therefore ...

The dihedral group D_6 gives the group of symmetries of a regular hexagon. The group generators are given by a counterclockwise rotation through pi/3 radians and reflection ...