Search Results for ""

The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, ...

The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...

The absolute moment of M_n of a probability function P(x) taken about a point a is defined by M_n=int|x-a|^nP(x)dx.

A sequence of random variates X_0, X_1, ... is called absolutely fair if for n=1, 2, ..., <X_1>=0 and <X_(n+1)|X_1,...,X_n>=0 (Feller 1971, p. 210).

In probability, an event with Lebesgue measure 1.

There are several different definitions of the barbell graph. Most commonly and in this work, the n-barbell graph is the simple graph obtained by connecting two copies of a ...

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.