Search Results for ""

A graph for which every node has finite degree.

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

One of the Eilenberg-Steenrod axioms. It states that, for every pair (X,A), there is a natural long exact sequence ...->H_n(A)->H_n(X)->H_n(X,A)->H_(n-1)(A)->..., where the ...

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

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

A method for constructing magic squares of odd order.

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...

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

A Lyndon word is an aperiodic notation for representing a necklace.

A tree not having the complete bipartite graph K_(1,2) with base at the vertex of degree two as a limb (Lu et al. 1993, Lu 1996).