Search Results for ""

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

The number of nodes in a graph is called its order.

The operation of taking an nth root of a number.

A formula for the generalized Catalan number _pd_(qi). The general formula is (n-q; k-1)=sum_(i=1)^k_pd_(qi)(n-pi; k-i), where (n; k) is a binomial coefficient, although ...

To divide is to perform the operation of division, i.e., to see how many times a divisor d goes into another number n. n divided by d is written n/d or n÷d. The result need ...

The Epstein zeta function for a n×n matrix S of a positive definite real quadratic form and rho a complex variable with R[rho]>n/2 (where R[z] denotes the real part) is ...

Let A and B be two classes of positive integers. Let A(n) be the number of integers in A which are less than or equal to n, and let B(n) be the number of integers in B which ...

A branch point whose neighborhood of values wrap around an infinite number of times as their complex arguments are varied. The point z=0 under the function lnz is therefore a ...

A set of n cells in an n×n square such that no two come from the same row and no two come from the same column. The number of transversals of an n×n square is n! (n ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...