Search Results for ""

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

The gyroid, illustrated above, is an infinitely connected periodic minimal surface containing no straight lines (Osserman 1986) that was discovered by Schoen (1970). ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...

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

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

There are certain optimization problems that become unmanageable using combinatorial methods as the number of objects becomes large. A typical example is the traveling ...

The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...

There are at least two distinct (though related) notions of the term Hilbert algebra in functional analysis. In some literature, a linear manifold A of a (not necessarily ...

Let sigma(m) be the divisor function of m. Then two numbers m and n are a quasiamicable pair if sigma(m)=sigma(n)=m+n+1. The first few are (48, 75), (140, 195), (1050, 1925), ...