Search Results for ""

An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...

The group D_5 is one of the two groups of order 10. Unlike the cyclic group C_(10), D_5 is non-Abelian. The molecule ruthenocene (C_5H_5)_2Ru belongs to the group D_(5h), ...

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

Each of the sets forming a direct product is said to be a direct factor. A group G is said to be a direct factor of the group G^' if G^' is isomorphic to the group direct ...

The disjoint union of two sets A and B is a binary operator that combines all distinct elements of a pair of given sets, while retaining the original set membership as a ...

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

Let C be a smooth geometrically connected projective curve over F_q with q=p^s a prime power. Let infty be a fixed closed point of X but not necessarily F_q-rational. A ...

The Earth-Moon problem is a special case of the empire problem for countries with m=2 disjoint regions, with one region of each country lying on the Earth and one on the Moon ...

A group action G×X->X is effective if there are no trivial actions. In particular, this means that there is no element of the group (besides the identity element) which does ...

A graph G with m edges is said to be elegant if the vertices of G can be labeled with distinct integers (0,1,2,...,m) in such a way that the set of values on the edges ...