Search Results for ""

A type of diagram invented by Lewis Carroll (the name is an abbreviation of "Lewis") that can be used to determine the number of minimal covers of n numbers with k members.

A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.

A linear code over a finite field with q elements F_q is a linear subspace C subset F_q^n. The vectors forming the subspace are called codewords. When codewords are chosen ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

A graph for which every node has finite degree.

The log-series distribution, also sometimes called the logarithmic distribution (although this work reserves that term for a distinct distribution), is the distribution of ...

For all integers n and |x|<a, lambda_n^((t))(x+a)=sum_(k=0)^infty|_n; k]lambda_(n-k)^((t))(a)x^k, where lambda_n^((t)) is the harmonic logarithm and |_n; k] is a Roman ...

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

Let p be prime and r = r_mp^m+...+r_1p+r_0 (0<=r_i<p) (1) k = k_mp^m+...+k_1p+k_0 (0<=k_i<p), (2) then (r; k)=product_(i=0)^m(r_i; k_i) (mod p). (3) This is proved in Fine ...