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 quintic symmetric graph is a quintic graph (i.e., regular of degree 5) that is also symmetric. Since quintic graphs exist only on an even number of nodes, so do symmetric ...

The algorithm of constructing and interpreting a quotient-difference table which allows interconversion of continued fractions, power series, and rational functions ...

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...

On a three-dimensional lattice, a random walk has less than unity probability of reaching any point (including the starting point) as the number of steps approaches infinity. ...

Closed forms are known for the sums of reciprocals of even-indexed Lucas numbers P_L^((e)) = sum_(n=1)^(infty)1/(L_(2n)) (1) = sum_(n=1)^(infty)1/(phi^(2n)+phi^(-2n)) (2) = ...

R(X_1,...X_n)=sum_(i=1)^nH(X_i)-H(X_1,...,X_n), where H(x_i) is the entropy and H(X_1,...,X_n) is the joint entropy. Linear redundancy is defined as ...

The word residue is used in a number of different contexts in mathematics. Two of the most common uses are the complex residue of a pole, and the remainder of a congruence. ...

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