Search Results for ""

The arithmetic-geometric index of a graph is defined as half the sum of the matrix elements of its arithmetic-geometric matrix.

The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...

The (n,k)-arrangement graph A_(n,k) is defined as the graph on the vertex set consisting of the permutations of {1,2,...,n} containing at most k elements where vertices are ...

The mathematical study of abstract computing machines (especially Turing machines) and the analysis of algorithms used by such machines. A connection between automata theory ...

The axiom of Zermelo-Fraenkel set theory which asserts that sets formed by the same elements are equal, forall x(x in a=x in b)=>a=b. Note that some texts (e.g., Devlin ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence for any sets a and b of a set x having a and b as its only elements. x is called the unordered pair of a ...

A bar (also called an overbar) is a horizontal line written above a mathematical symbol to give it some special meaning. If the bar is placed over a single symbol, as in x^_ ...

Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...

The term Bol loop refers to either of two classes of algebraic loops satisfying the so-called Bol identities. In particular, a left Bol loop is an algebraic loop L which, for ...

In the theory of transfinite ordinal numbers, 1. Every well ordered set has a unique ordinal number, 2. Every segment of ordinals (i.e., any set of ordinals arranged in ...