Search Results for ""

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 ...

The center of a group is the set of elements which commute with every element of the group. It is equal to the intersection of the centralizers of the group elements.

The convolution of two complex-valued functions on a group G is defined as (a*b)(g)=sum_(k in G)a(k)b(k^(-1)g) where the support (set which is not zero) of each function is ...

The set of sums sum_(x)a_xx ranging over a multiplicative group and a_i are elements of a field with all but a finite number of a_i=0. Group rings are graded algebras.

The set of all ground atoms that can be formed from predicate symbols from a clause in Skolemized form S and terms from the Herbrand universe H of S.

The fifth of Peano's axioms, which states: If a set S of numbers contains zero and also the successor of every number in S, then every number is in S.

Greater than any assignable quantity of the sort in question. In mathematics, the concept of the infinite is made more precise through the notion of an infinite set.

The integral closure of a commutative unit ring R in an extension ring S is the set of all elements of S which are integral over R. It is a subring of S containing R.

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.