Search Results for ""

A n-dipyramidal graph is the skeleton of an n-sided dipyramid. It is isomorphic to the (m,2)-cone graph C_m+K^__2, where C_m is a cycle graph, K^__2 is the empty graph on 2 ...

A statistical distribution whose variables can take on only discrete values. Abramowitz and Stegun (1972, p. 929) give a table of the parameters of most common discrete ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

A dot plot, also called a dot chart, is a type of simple histogram-like chart used in statistics for relatively small data sets where values fall into a number of discrete ...

Let K be the knot above, and let the homomorphism h taking a knot K_1 to its companion knot K_2 be faithful (i.e., taking the preferred longitude and meridian of the original ...

The dual vector space to a real vector space V is the vector space of linear functions f:V->R, denoted V^*. In the dual of a complex vector space, the linear functions take ...

A Dyck path is a staircase walk from (0,0) to (n,n) that lies strictly below (but may touch) the diagonal y=x. The number of Dyck paths of order n is given by the Catalan ...

An E_8 polytope is a polytope having the symmetry of the exceptional simple Lie groups E_8 of dimension 248. There are 255 uniform polytopes with E_8 symmetry in 8 ...

The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...

Let T be a central triangle and let U(T) be its unary cofactor triangle. Then T and U(T) are perspective, and their perspector is called the eigencenter of T. Let the A-, B-, ...