Search Results for ""

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...

Universal algebra studies common properties of all algebraic structures, including groups, rings, fields, lattices, etc. A universal algebra is a pair A=(A,(f_i^A)_(i in I)), ...

Let (K,L) be a pair consisting of finite, connected CW-complexes where L is a subcomplex of K. Define the associated chain complex C(K,L) group-wise for each p by setting ...

The numbers 2^npq and 2^nr are an amicable pair if the three integers p = 2^m(2^(n-m)+1)-1 (1) q = 2^n(2^(n-m)+1)-1 (2) r = 2^(n+m)(2^(n-m)+1)^2-1 (3) are all prime numbers ...

Two integers n and m<n are (alpha,beta)-multiamicable if sigma(m)-m=alphan and sigma(n)-n=betam, where sigma(n) is the divisor function and alpha,beta are positive integers. ...

If three conics pass through two given points Q and Q^', then the lines joining the other two intersections of each pair of conics P_(ij)P_(ij)^' are concurrent at a point X ...

An n-tuple, sometimes simply called a "tuple" when the number n is known implicitly, is another word for a list, i.e., an ordered set of n elements. It can be interpreted as ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

All the propositions in projective geometry occur in dual pairs which have the property that, starting from either proposition of a pair, the other can be immediately ...