Search Results for ""

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

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

For a permutation alpha in the symmetric group S_p, the alpha-permutation graph of a labeled graph G is the graph union of two disjoint copies of G (say, G_1 and G_2), ...

A module having only one element: the singleton set {*}. It is a module over any ring R with respect to the multiplication defined by a*=* (1) for every a in R, and the ...

The space groups in two dimensions are called wallpaper groups. In three dimensions, the space groups are the symmetry groups possible in a crystal lattice with the ...

A general reciprocity theorem for all orders which covered all other known reciprocity theorems when proved by E. Artin in 1927. If R is a number field and R^' a finite ...

A type of sale in which members of a group of buyers offer ever increasing amounts. The bidder making the last bid (for which no higher bid is subsequently made within a ...

A subset tau in S_n of a permutation {1,...,n} is said to contain alpha in S_k if there exist 1<=i_1<...<i_k<=n such that tau=(tau_i,...,tau_k) is order isomorphic to ...

A decomposition of a module into a direct sum of submodules. The index set for the collection of submodules is then called the grading set. Graded modules arise naturally in ...

A game in which the possible moves are the same for each player in any position. All positions in all impartial games form an additive Abelian group. For impartial games in ...