Search Results for ""

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...

Define the correlation integral as C(epsilon)=lim_(N->infty)1/(N^2)sum_(i,j=1; i!=j)^inftyH(epsilon-|x_i-x_j|), (1) where H is the Heaviside step function. When the below ...

For a subgroup H of a group G and an element x of G, define xH to be the set {xh:h in H} and Hx to be the set {hx:h in H}. A subset of G of the form xH for some x in G is ...

The cototient of a positive number n is defined as n-phi(n), where n is the totient function. It is therefore the number of positive integers <=n that have at least one prime ...

A set function mu possesses countable additivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess countable monotonicity provided that, whenever a set E in S is covered by ...

Any set which can be put in a one-to-one correspondence with the natural numbers (or integers) so that a prescription can be given for identifying its members one at a time ...

A labeled graph whose nodes are indexed by the generators of a Coxeter group having (P_i,P_j) as an graph edge labeled by M_(ij) whenever M_(ij)>2, where M_(ij) is an element ...

Defining p_0=2, p_n as the nth odd prime, and the nth prime gap as g_n=p_(n+1)-p_n, then the Cramér-Granville conjecture states that g_n<M(lnp_n)^2 for some constant M>1.

A nonplanar graph G is said to be critical nonplanar if the removal of a vertex results in a planar graph for every vertex of G. Critical nonplanar graphs differ from apex ...