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

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

The café wall illusion, sometimes also called the Münsterberg illusion (Ashton Raggatt McDougall 2006), is an optical illusion produced by a black and white rectangular ...

Calabi-Yau spaces are important in string theory, where one model posits the geometry of the universe to consist of a ten-dimensional space of the form M×V, where M is a four ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...

Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...

The curve given by the polar equation r=a(1-costheta), (1) sometimes also written r=2b(1-costheta), (2) where b=a/2. The cardioid has Cartesian equation ...

Define a carefree couple as a pair of positive integers (a,b) such that a and b are relatively prime (i.e., GCD(a,b)=1) and a is squarefree. Similarly, define a strongly ...