Search Results for ""

The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

The octahedral equation, by way of analogy with the icosahedral equation, is a set of related equations derived from the projective geometry of the octahedron. Consider an ...

The polar sine is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the lengths of the n edges of the ...

A quartic symmetric graph is a symmetric graph that is also quartic (i.e., regular of degree 4). The numbers of symmetric quartic graphs on n=1, 2, ... are 0, 0, 0, 0, 1, 1, ...

A square pyramid is a pyramid with a square base. It is a pentahedron. The lateral edge length e and slant height s of a right square pyramid of side length a and height h ...

The tetrahedral equation, by way of analogy with the icosahedral equation, is a set of related equations derived from the projective geometry of the octahedron. Consider a ...

The trapezo-rhombic dodecahedron, also called the rhombo-trapezoidal dodecahedron, is a general dodecahedron consisting of six identical rhombi and six identical isosceles ...