Search Results for ""

The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...

The Gudermannian function is the odd function denoted either gamma(x) or gd(x) which arises in the inverse equations for the Mercator projection. phi(y)=gd(y) expresses the ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...

Hadjicostas's formula is a generalization of the unit square double integral gamma=int_0^1int_0^1(x-1)/((1-xy)ln(xy))dxdy (1) (Sondow 2003, 2005; Borwein et al. 2004, p. 49), ...

A map u:M->N, between two compact Riemannian manifolds, is a harmonic map if it is a critical point for the energy functional int_M|du|^2dmu_M. The norm of the differential ...

A harmonic number is a number of the form H_n=sum_(k=1)^n1/k (1) arising from truncation of the harmonic series. A harmonic number can be expressed analytically as ...

Like the entire harmonic series, the harmonic series sum_(k=1)^infty1/(p_k)=infty (1) taken over all primes p_k also diverges, as first shown by Euler in 1737 (Nagell 1951, ...