Search Results for ""

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

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

The voter model is a simple mathematical model of opinion formation in which voters are located at the nodes of a network, each voter has an opinion (in the simplest case, 0 ...

A circle with an arrow indicating a direction.

Not concentric.

The radius of the smallest circle centered at one of the points of an N-cluster, which contains all the points in the N-cluster.

A face-centered cubic sphere packing obtained by placing layers of spheres one on top of another. Because there are two distinct ways to place each layer on top of the ...

The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.

Taking the locus of midpoints from a fixed point to a circle of radius r results in a circle of radius r/2. This follows trivially from r(theta) = [-x; 0]+1/2([rcostheta; ...

In Homogeneous coordinates (x_1,x_2,x_3), the equation of a circle C is a(x_1^2+x_2^2)+2fx_2x_3+2gx_1x_3+cx_3^2=0. The discriminant of this circle is defined as Delta=|a 0 g; ...