Search Results for ""

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).

A fractional clique of a graph G is a nonnegative real function on the vertices of G such that sum of the values on the vertices of any independent set is at most one. The ...

Frey's theorem states that every Abelian category is a subcategory of some category of modules over a ring. Mitchell (1964) has strengthened this, saying every Abelian ...

A congruence of the form f(x)=g(x) (mod n), where f(x) and g(x) are both integer polynomials. Functional congruences are sometimes also called "identical congruences" (Nagell ...

A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...

For a form Q, the generic character chi_i(Q) of Q is defined as the values of chi_i(m) where (m,2d)=1 and Q represents m: chi_1(Q), chi_2(Q), ..., chi_r(Q) (Cohn 1980, p. ...

The composition G=G_1[G_2] of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with point vertex V_1×V_2 and u=(u_1,u_2) ...

The graph difference of graphs G and H is the graph with adjacency matrix given by the difference of adjacency matrices of G and H. A graph difference is defined when the ...

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

The periphery of a graph G is the subgraph of G induced by vertices that have graph eccentricities equal to the graph diameter. The periphery of a connected graph may be ...