Search Results for ""

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

Given a chord PQ of a circle, draw any other two chords AB and CD passing through its midpoint. Call the points where AD and BC meet PQ X and Y. Then M is also the midpoint ...

A binary unit of information equal to 8 bits. Unfortunately, the storage of binary numbers in computers is not entirely standardized. Because computers store information in ...

A Calkin-Wilf tree is a special type of binary tree obtained by starting with the fraction 1/1 and iteratively adding a/(a+b) and (a+b)/b below each fraction a/b. The ...

The word canonical is used to indicate a particular choice from of a number of possible conventions. This convention allows a mathematical object or class of objects to be ...

The Cantor function F(x) is the continuous but not absolutely continuous function on [0,1] which may be defined as follows. First, express x in ternary. If the resulting ...

Let A and B be any sets with empty intersection, and let |X| denote the cardinal number of a set X. Then |A|+|B|=|A union B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; ...

The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...

The circumcircle of the Cevian triangle DeltaA^'B^'C^' of a given triangle DeltaABC with respect to a point P. The following table summarizes a number of named Cevian circles ...