Search Results for ""

A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...

Tutte's fragment (Taylor 1997) is the 15-node graph illustrated above (Grünbaum 2003, pp. 358-359 and Fig. 17.1.3). If the graph obtained by adding pendant edges to corners ...

Tutte's (46-vertex) graph is a cubic nonhamiltonian graph contructed by Tutte (1946) as a counterexample to Tait's Hamiltonian graph conjecture by using three copies ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

The Wiener-Araya graph (Wiener and Araya 2009) is the 42-vertex graph illustrated above that was the smallest known example of a planar hypohamiltonian graph, beating the ...

Probability and Statistics

A connective in logic which yields true if all conditions are true, and false if any condition is false. A AND B is denoted A ^ B (Mendelson 1997, p. 12), A&B, A intersection ...

A mechanical counting device consisting of a frame holding a series of parallel rods on each of which beads are strung. Each bead represents a counting unit, and each rod a ...

An additive group is a group where the operation is called addition and is denoted +. In an additive group, the identity element is called zero, and the inverse of the ...

The lines connecting the vertices and corresponding circle-circle intersections in Malfatti's problem coincide in a point X_(179) called the first Ajima-Malfatti point ...