Search Results for ""

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

The tetragonal antiwedge graph is the skeleton of the tetragonal antiwedge. It is a has 6 vertices, 10 edges, and 6 faces. The tetragonal antiwedge graph is self-dual and is ...

Propositional calculus is the formal basis of logic dealing with the notion and usage of words such as "NOT," "OR," "AND," and "implies." Many systems of propositional ...

Turmites, also called turning machines, are 2-dimensional Turing machines in which the "tape" consists of a grid of spaces that can be written and erased by an active ...

"Aggregate" is an archaic word for infinite sets such as those considered by Georg Cantor. The term is sometimes also used to refer to a finite or infinite set in which ...

An algebraic identity is a mathematical identity involving algebraic functions. Examples include the Euler four-square identity, Fibonacci identity, Lebesgue identity, and ...

A field K is said to be algebraically closed if every polynomial with coefficients in K has a root in K.

An antilinear operator A^~ satisfies the following two properties: A^~[f_1(x)+f_2(x)] = A^~f_1(x)+A^~f_2(x) (1) A^~cf(x) = c^_A^~f(x), (2) where c^_ is the complex conjugate ...

The three circular triangles A^'B^'C^', AB^'C^', A^'BC^', and A^'B^'C obtained by extending the arcs of a circular triangle ABC into complete circles.