Search Results for ""

In celestial mechanics, the fixed path a planet traces as it moves around the sun is called an orbit. When a group G acts on a set X (this process is called a group action), ...

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

A relation R on a set S is irreflexive provided that no element is related to itself; in other words, xRx for no x in S.

A relation R on a set S is reflexive provided that xRx for every x in S.

A reflexive relation.

The group of functions from an object G to itself which preserve the structure of the object, denoted Aut(G). The automorphism group of a group preserves the multiplication ...

A permutation group (G,X) is k-homogeneous if it is transitive on unordered k-subsets of X. The projective special linear group PSL(2,q) is 3-homogeneous if q=3 (mod 4).

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...