Search Results for ""

The curve formed by the intersection of a cylinder and a sphere is known as Viviani's curve. The problem of finding the lateral surface area of a cylinder of radius r ...

The map projection having transformation equations x = (lambda-lambda_0)cosphi_s (1) y = sinphisecphi_s (2) for the normal aspect, where lambda is the longitude, lambda_0 is ...

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

An n×n-matrix A is said to be diagonalizable if it can be written on the form A=PDP^(-1), where D is a diagonal n×n matrix with the eigenvalues of A as its entries and P is a ...

The dihedral group D_n is the symmetry group of an n-sided regular polygon for n>1. The group order of D_n is 2n. Dihedral groups D_n are non-Abelian permutation groups for ...

A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...

Let c and d!=c be real numbers (usually taken as c=1 and d=0). The Dirichlet function is defined by D(x)={c for x rational; d for x irrational (1) and is discontinuous ...

There are several types of integrals which go under the name of a "Dirichlet integral." The integral D[u]=int_Omega|del u|^2dV (1) appears in Dirichlet's principle. The ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...