Search Results for ""

The graph difference of graphs G and H is the graph with adjacency matrix given by the difference of adjacency matrices of G and H. A graph difference is defined when the ...

The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).

A partially ordered set is defined as an ordered pair P=(X,<=). Here, X is called the ground set of P and <= is the partial order of P.

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 points of X fixed by a group action are called the group's set of fixed points, defined by {x:gx=x for all g in G}. In some cases, there may not be a group action, ...

A group set is a set whose elements are acted on by a group. If the group G acts on the set S, then S is called a G-set. Let G be a group and let S be a G-set. Then for every ...

If G is a group, then the torsion elements Tor(G) of G (also called the torsion of G) are defined to be the set of elements g in G such that g^n=e for some natural number n, ...

There are at least three definitions of "groupoid" currently in use. The first type of groupoid is an algebraic structure on a set with a binary operator. The only ...

The hacovercosine, also known as the hacoversed cosine and cohavercosine, is a little-used trigonometric function defined by hacovercos(z) = covercosz (1) = 1/2(1+sinz), (2) ...

The hacoversine, also known as the hacoversed sine and cohaversine, is a little-used trigonometric function defined by hacoversin(z) = coversinz (1) = 1/2(1-sinz), (2) where ...