Search Results for ""

A quasi-qunitic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...

Following Ramanujan (1913-1914), write product_(k=1,3,5,...)^infty(1+e^(-kpisqrt(n)))=2^(1/4)e^(-pisqrt(n)/24)G_n (1) ...

If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...

A prime which does not divide the class number h(p) of the cyclotomic field obtained by adjoining a primitive pth root of unity to the field of rationals. A prime p is ...

Let a discrete distribution have probability function p_k, and let a second discrete distribution have probability function q_k. Then the relative entropy of p with respect ...

The residue classes of a function f(x) mod n are all possible values of the residue f(x) (mod n). For example, the residue classes of x^2 (mod 6) are {0,1,3,4}, since 0^2=0 ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

The ring of integers is the set of integers ..., -2, -1, 0, 1, 2, ..., which form a ring. This ring is commonly denoted Z (doublestruck Z), or sometimes I (doublestruck I). ...

In the directed graph above, pick any vertex and follow the arrows in sequence blue-red-red three times. You will finish at the green vertex. Similarly, follow the sequence ...