Search Results for ""

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...

The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].

The first theorem of Pappus states that the surface area S of a surface of revolution generated by the revolution of a curve about an external axis is equal to the product of ...

A quartic vertex-transitive graph is a quartic graph that is vertex transitive. Read and Wilson (1988, pp. 164-166) enumerate all connected quartic vertex-transitive graphs ...

The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial pi_(theta_0)(z)=z^7-8z^6+28z^5-56z^4+68z^3-47z^2+14z and chromatic ...