Search Results for ""

The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...

A generalized eigenvector for an n×n matrix A is a vector v for which (A-lambdaI)^kv=0 for some positive integer k in Z^+. Here, I denotes the n×n identity matrix. The ...

A generalization of the equation whose solution is desired in Fermat's last theorem x^n+y^n=z^n to x^n+y^n=cz^n for x, y, z, and c positive constants, with trivial solutions ...

The surface generated by a twisted curve C when rotated about a fixed axis A and, at the same time, displaced parallel to A so that the velocity of displacement is always ...

A generalized Vandermonde matrix of two sequences a and b where a is an increasing sequence of positive integers and b is an increasing sequence of nonnegative integers of ...

Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...

Let I(x,y) denote the set of all vertices lying on an (x,y)-graph geodesic in G, then a set S with I(S)=V(G) is called a geodetic set in G and is denoted g(G).

Given a planar graph G, its geometric dual G^* is constructed by placing a vertex in each region of G (including the exterior region) and, if two regions have an edge x in ...