Search Results for ""

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let rho be the number of graph edges at each node, rho^* the number of ...

A number of attractive 2-compounds of the regular dodecahedron can be constructed. The first (left figures) has the symmetry of the cube and arises by combining two regular ...

An irrational number x can be called GK-regular (defined here for the first time) if the distribution of its continued fraction coefficients is the Gauss-Kuzmin distribution. ...

Goldberg polyhedra are convex polyhedra first described by Goldberg (1937) and classified in more detail by Hart (2013) for which each face is a regular pentagon or regular ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

A hexagonal prism is a prism composed of two hexagonal bases and six rectangular sides. It is an octahedron. The regular right hexagonal prism is a space-filling polyhedron. ...

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 McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

Let u_(p) be a unit tangent vector of a regular surface M subset R^3. Then the normal curvature of M in the direction u_(p) is kappa(u_(p))=S(u_(p))·u_(p), (1) where S is the ...