Search Results for ""

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

The circumcenter is the center O of a triangle's circumcircle. It can be found as the intersection of the perpendicular bisectors. The trilinear coordinates of the ...

The term "cylinder" has a number of related meanings. In its most general usage, the word "cylinder" refers to a solid bounded by a closed generalized cylinder (a.k.a. ...

Dawson's integral (Abramowitz and Stegun 1972, pp. 295 and 319), also sometimes called Dawson's function, is the entire function given by the integral F(x) = ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

The gem graph is the fan graph F_(4,1) illustrated above. It is implemented in the Wolfram Language as GraphData["GemGraph"].

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

The curve produced by fixed point P on the circumference of a small circle of radius b rolling around the inside of a large circle of radius a>b. A hypocycloid is therefore a ...