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

Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...

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

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 number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...

If Y_i have normal independent distributions with mean 0 and variance 1, then chi^2=sum_(i=1)^rY_i^2 (1) is distributed as chi^2 with r degrees of freedom. This makes a chi^2 ...

The chromatic invariant theta(G) of a connected graph G is the number of spanning trees of G that have internal activity 1 and external activity 0. For graphs other than the ...