Search Results for ""

Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...

"Implies" is the connective in propositional calculus which has the meaning "if A is true, then B is also true." In formal terminology, the term conditional is often used to ...

The insphere of a solid is a sphere that is tangent to all faces of the solid. An insphere does not always exist, but when it does, its radius r is called the inradius and ...

The Janko-Kharaghani-Tonchev graph is a strongly regular graph on 324 vertices and 24786 edges. It has regular parameters (nu,k,lambda,mu)=(324,153,72,72). It is implemented ...

Since each triplet of Yff circles are congruent and pass through a single point, they obey Johnson's theorem. As a result, in each case, there is a fourth circle congruent to ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

The so-called generalized Kadomtsev-Petviashvili-Burgers equation is the partial differential equation ...

Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...

The Kauffman X-polynomial, also called the normalized bracket polynomial, is a 1-variable knot polynomial denoted X (Adams 1994, p. 153), L (Kauffman 1991, p. 33), or F ...