Search Results for ""

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

Let V be a vector space over a field K, and let A be a nonempty set. For an appropriately defined affine space A, K is called the coefficient field.

The cotangent bundle of a manifold is similar to the tangent bundle, except that it is the set (x,f) where x in M and f is a dual vector in the tangent space to x in M. The ...

The simplest algebraic language, denoted D. If X is the alphabet {x,x^_}, then D is the set of words u of X which satisfy 1. |u|_x=|u|_(x^_), where |u|_x is the numbers of ...

For an atomic integral domain R (i.e., one in which every nonzero nonunit can be factored as a product of irreducible elements) with I(R) the set of irreducible elements, the ...

The Cartesian product of a finite or infinite set of modules over a ring with only finitely many nonzero entries in each sequence.

The field of reals is the set of real numbers, which form a field. This field is commonly denoted R (doublestruck R).

A function element is an ordered pair (f,U) where U is a disk D(Z_0,r) and f is an analytic function defined on U. If W is an open set, then a function element in W is a pair ...

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...