Search Results for ""

The z-score associated with the ith observation of a random variable x is given by z_i=(x_i-x^_)/sigma, where x^_ is the mean and sigma the standard deviation of all ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

A spatial-temporal point process is a point process which models data that is localized at a discrete set of locations in both space and time. In particular, a ...

A matching is a maximum matching iff it contains no augmenting path.

Given a point lattice, a cluster is a group of filled cells which are all connected to their neighbors vertically or horizontally.

A polyhedral graph having 10 vertices. There are 32300 nonisomorphic nonahedral graphs, as first enumerated by Duijvestijn and Federico (1981).

A fork of a tree T is a node of T which is the endpoint of two or more branches.

A formula for the generalized Catalan number _pd_(qi). The general formula is (n-q; k-1)=sum_(i=1)^k_pd_(qi)(n-pi; k-i), where (n; k) is a binomial coefficient, although ...