Search Results for ""

The general ellipsoid, also called a triaxial ellipsoid, is a quadratic surface which is given in Cartesian coordinates by (x^2)/(a^2)+(y^2)/(b^2)+(z^2)/(c^2)=1, (1) where ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

The elliptic logarithm is generalization of integrals of the form int_infty^x(dt)/(sqrt(t^2+at)), for a real, which can be expressed in terms of logarithmic and inverse ...

The Mercator series, also called the Newton-Mercator series (Havil 2003, p. 33), is the Taylor series for the natural logarithm ln(1+x) = sum_(k=1)^(infty)((-1)^(k+1))/kx^k ...

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

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

|_n]!={n! for n>=0; ((-1)^(-n-1))/((-n-1)!) for n<0. (1) The Roman factorial arises in the definition of the harmonic logarithm and Roman coefficient. It obeys the identities ...

The ABC (atom-bond connectivity) matrix A_(ABC) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt((d_i+d_j-2)/(d_id_j)), (1) where d_i are the ...

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

Graph Strength