Search Results for ""

The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...

The logarithmic spiral is a spiral whose polar equation is given by r=ae^(btheta), (1) where r is the distance from the origin, theta is the angle from the x-axis, and a and ...

A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...

Given any tree T having v vertices of vertex degrees of 1 and 3 only, form an n-expansion by taking n disjoint copies of T and joining corresponding leaves by an n-cycle ...

Legendre-Gauss quadrature is a numerical integration method also called "the" Gaussian quadrature or Legendre quadrature. A Gaussian quadrature over the interval [-1,1] with ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

A sequence produced by the instructions "reverse, add to the original, then sort the digits." For example, after 668, the next iteration is given by 668+866=1534, so the next ...

The following integral transform relationship, known as the Abel transform, exists between two functions f(x) and g(t) for 0<alpha<1, f(x) = int_0^x(g(t)dt)/((x-t)^alpha) (1) ...

An acyclic digraph is a directed graph containing no directed cycles, also known as a directed acyclic graph or a "DAG." Every finite acyclic digraph has at least one node of ...

The orthic axis of the excentral triangle, which is central line L_1 (Casey 1888, p. 177; Kimberling 1998, p. 150) and therefore has trilinear equation alpha+beta+gamma=0. It ...