Search Results for ""

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

The approximation for pi given by pi approx sqrt((40)/3-2sqrt(3)) (1) = 1/3sqrt(120-18sqrt(3)) (2) = 3.141533.... (3) In the above figure, let OA=OF=1, and construct the ...

The simplest interpretation of the Kronecker delta is as the discrete version of the delta function defined by delta_(ij)={0 for i!=j; 1 for i=j. (1) The Kronecker delta is ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

Let generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z] (1) have p=q+1. Then the generalized hypergeometric function is said to ...

A polyare is a polyform formed from a polyomino by removing of half of each square such that at least half of the original join between squares is retained. The first few ...

An alternating multilinear form on a real vector space V is a multilinear form F:V tensor ... tensor V->R (1) such that ...

The catacaustic of a cardioid for a radiant point along the x-axis is complicated function of x. For x=0 (i.e., with radiant point at the cusp), however, the catacaustic for ...

Let {p_n(x)} be orthogonal polynomials associated with the distribution dalpha(x) on the interval [a,b]. Also let rho=c(x-x_1)(x-x_2)...(x-x_l) (for c!=0) be a polynomial of ...