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

A number n such that the "LED representation" of n (i.e., the arrangement of horizonal and vertical lines seen on a digital clock or pocket calculator), n upside down, n in a ...

A Diophantine equation is an equation in which only integer solutions are allowed. Hilbert's 10th problem asked if an algorithm existed for determining whether an arbitrary ...

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

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

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

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...