Search Results for ""

A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...

Stellation is the process of constructing polyhedra by extending the facial planes past the polyhedron edges of a given polyhedron until they intersect (Wenninger 1989). The ...

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

A (p,q)-torus knot is obtained by looping a string through the hole of a torus p times with q revolutions before joining its ends, where p and q are relatively prime. A ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

Convergents of the pi continued fractions are the simplest approximants to pi. The first few are given by 3, 22/7, 333/106, 355/113, 103993/33102, 104348/33215, ... (OEIS ...

The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...

A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

The pure equation x^p=C of prime degree p is irreducible over a field when C is a number of the field but not the pth power of an element of the field. Jeffreys and Jeffreys ...