Search Results for ""

The n-wheel complement graph W^__n is the graph complement of the n-wheel graph. For n>4, W^__n is isomorphic to the graph disjoint union of a circulant graph ...

A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

(d^2u)/(dz^2)+(du)/(dz)+(k/z+(1/4-m^2)/(z^2))u=0. (1) Let u=e^(-z/2)W_(k,m)(z), where W_(k,m)(z) denotes a Whittaker function. Then (1) becomes ...

Begin with the Yff central triangle and then parallel-displace the isoscelizers in such a way as to reduce the central triangle to a point while keeping the other three ...

The version of set theory obtained if Axiom 6 of Zermelo-Fraenkel set theory is replaced by 6'. Selection axiom (or "axiom of subsets"): for any set-theoretic formula A(u), ...

Given a positive nondecreasing sequence 0<lambda_1<=lambda_2<=..., the zeta-regularized product is defined by product_(n=1)^^^inftylambda_n=exp(-zeta_lambda^'(0)), where ...

The Zolotarev-Schur constant is given by sigma = 1/(c^2)[1-(E(c))/(K(c))]^2 (1) = 0.3110788667048... (2) (OEIS A143295), where K(c) is a complete elliptic integral of the ...

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...

The square of the area of the base (i.e., the face opposite the right trihedron) of a trirectangular tetrahedron is equal to the sum of the squares of the areas of its other ...

The probability of getting at least one "6" in four rolls of a single 6-sided die is 1-(5/6)^4 approx 0.5177, (1) which is slightly higher than the probability of at least ...