Search Results for ""

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

A triangle in which all three angles are acute angles. A triangle which is neither acute nor a right triangle (i.e., it has an obtuse angle) is called an obtuse triangle. ...

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

A modified Miller's primality test which gives a guarantee of primality or compositeness. The algorithm's running time for a number n has been proved to be as ...

The adjective "affine" indicates everything that is related to the geometry of affine spaces. A coordinate system for the n-dimensional affine space R^n is determined by any ...