Search Results for ""

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

An m×n matrix which gives the possible outcome of a two-person zero-sum game when player A has m possible moves and player B n moves. The analysis of the matrix in order to ...

Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...

The study of the probabilities involved in geometric problems, e.g., the distributions of length, area, volume, etc. for geometric objects under stated conditions. The ...

The word "median" has several different meanings in mathematics all related to the "middle" of mathematical objects. The statistical median is an order statistic that gives ...

The first corona of a tile is the set of all tiles that have a common boundary point with that tile (including the original tile itself). The second corona is the set of ...

Given a simplex of unit content in Euclidean d-space, pick n>=d+1 points uniformly and independently at random, and denote the expected content of their convex hull by ...

The dual of the great truncated cuboctahedron U_(20) and Wenninger dual W_(93).

The dual of the great truncated icosidodecahedron U_(68) and Wenninger dual W_(108).

The dual of the small stellated truncated dodecahedron U_(58) and Wenninger dual W_(97).