Search Results for ""

The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...

The doubly truncated Witt graph is the graph on 330 vertices related to a 3-(22,8,12) design (Brouwer et al. 1989, p. 367). The doubly truncated Witt graph can be constructed ...

Maximize the distance a Jeep can penetrate into the desert using a given quantity of fuel. The Jeep is allowed to go forward, unload some fuel, and then return to its base ...

Zeno's paradoxes are a set of four paradoxes dealing with counterintuitive aspects of continuous space and time. 1. Dichotomy paradox: Before an object can travel a given ...

Given two bicentric points P=p:q:r and U=u:v:w, their bicentric sum is defined by p+u:q+v:r:w.

A function y=f(x) has critical points at all points x_0 where f^'(x_0)=0 or f(x) is not differentiable. A function z=f(x,y) has critical points where the gradient del f=0 or ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...

If an infinite number of points in the plane are all separated by integer distances, then all the points lie on a straight line.

The angular velocity omega is the time derivative of the angular distance theta with direction z^^ perpendicular to the plane of angular motion, omega=(dtheta)/(dt)z^^=(v)/r.