Search Results for ""

The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...

An apodization function (also called a tapering function or window function) is a function used to smoothly bring a sampled signal down to zero at the edges of the sampled ...

Consider three mutually tangent circles, and draw their inner Soddy circle. Then draw the inner Soddy circles of this circle with each pair of the original three, and ...

There are a number of meanings for the word "arc" in mathematics. In general, an arc is any smooth curve joining two points. The length of an arc is known as its arc length. ...

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

It is always possible to "fairly" divide a cake among n people using only vertical cuts. Furthermore, it is possible to cut and divide a cake such that each person believes ...

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

Continuum percolation can be thought of as a continuous, uncountable version of percolation theory-a theory which, in its most studied form, takes place on a discrete, ...

There are a number of attractive polyhedron compounds of two cubes. The first (left figures) is obtained by allowing two cubes to share opposite polyhedron vertices then ...

There are several attractive polyhedron compounds consisting of three cubes. The first (left figures) arises by joining three cubes such that each shares two C_2 axes (Holden ...