Search Results for ""

A symbol consisting of three rational numbers that can be used to describe uniform polyhedra based on how a point C in a spherical triangle can be selected so as to trace the ...

The shortest circular sequence of length sigma^n such that every string of length n on the alphabet a of size sigma occurs as a contiguous subrange of the sequence described ...

An alternating group is a group of even permutations on a set of length n, denoted A_n or Alt(n) (Scott 1987, p. 267). Alternating groups are therefore permutation groups. ...

A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...

Let L be an extension field of K, denoted L/K, and let G be the set of automorphisms of L/K, that is, the set of automorphisms sigma of L such that sigma(x)=x for every x in ...

The Games graph is a strongly regular graph on 729 vertices with parameters (nu,k,lambda,mu)=(729,112,1,20). It is distance-regular but not distance-transitive with ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...

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