Search Results for ""

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

Assignment of each graph edge of a graph to one of two color classes (commonly designation "red" and "green").

The greatest dividing exponent gde(n,b) of a base b with respect to a number n is the largest integer value of k such that b^k|n, where b^k<=n. It is implemented as the ...

A number t_x=tan^(-1)(1/x)=cot^(-1)x, where x is an integer or rational number, tan^(-1)x is the inverse tangent, and cot^(-1)x is the inverse cotangent. Gregory numbers ...

A formula satisfied by all Hamiltonian cycles with n nodes. Let f_j be the number of regions inside the circuit with j sides, and let g_j be the number of regions outside the ...

A dozen dozen, or the square number 144.

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