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, ...

The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...

The star graph S_n of order n, sometimes simply known as an "n-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on n nodes with ...

The Steiner circumellipse is the circumellipse that is the isotomic conjugate of the line at infinity and the isogonal conjugate of the Lemoine axis. It has circumconic ...

The Steinmetz solid is the solid common to two (or three) right circular cylinders of equal radii intersecting at right angles is called the Steinmetz solid. Two cylinders ...

A statistical distribution published by William Gosset in 1908. His employer, Guinness Breweries, required him to publish under a pseudonym, so he chose "Student." Given N ...

The tesseract is the hypercube in R^4, also called the 8-cell or octachoron. It has the Schläfli symbol {4,3,3}, and vertices (+/-1,+/-1,+/-1,+/-1). The figure above shows a ...

Thurston's conjecture proposed a complete characterization of geometric structures on three-dimensional manifolds. Before stating Thurston's geometrization conjecture in ...

The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...

The geometric centroid (center of mass) of the polygon vertices of a triangle is the point G (sometimes also denoted M) which is also the intersection of the triangle's three ...