Search Results for ""

The simplest class of one-dimensional cellular automata. Elementary cellular automata have two possible values for each cell (0 or 1), and rules that depend only on nearest ...

A number x in which the first n decimal digits of the fractional part frac(x) sum to 666 is known as an evil number (Pegg and Lomont 2004). However, the term "evil" is also ...

In a given triangle DeltaABC with all angles less than 120 degrees (2pi/3, the first Fermat point X or F_1 (sometimes simply called "the Fermat point," Torricelli point, or ...

The likelihood of a simple graph is defined by starting with the set S_1={(K_11)}. The following procedure is then iterated to produce a set of graphs G_n of order n. At step ...

The thickness (or depth) t(G) (Skiena 1990, p. 251; Beineke 1997) or theta(G) (Harary 1994, p. 120) of a graph G is the minimum number of planar edge-induced subgraphs P_i of ...

There are at least three definitions of "groupoid" currently in use. The first type of groupoid is an algebraic structure on a set with a binary operator. The only ...

The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...

The honeycomb toroidal graph HTG(m,2n,s) on 2nm vertices for m, n, and s positive integers satisfying n>1 and m+s is even is defined as the graph on vertex set u_(ij) for ...

There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...

An incircle is an inscribed circle of a polygon, i.e., a circle that is tangent to each of the polygon's sides. The center I of the incircle is called the incenter, and the ...