Search Results for ""

An Andreini tessellation is a three-dimensional equivalent of a semiregular tessellation. There are 28 such tessellations.

A multivariate polynomial (i.e., a polynomial in more than one variable) with all terms having the same degree. For example, x^3+xyz+y^2z+z^3 is a homogeneous polynomial of ...

A polynomial in which the sum of subscripts is the same in each term.

Perfect numbers are positive integers n such that n=s(n), (1) where s(n) is the restricted divisor function (i.e., the sum of proper divisors of n), or equivalently ...

An m-ary n-ic polynomial (i.e., a homogeneous polynomial with constant coefficients of degree n in m independent variables).

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

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 dodecicosahedral graph is the skeleton graph of the great ditrigonal dodecicosidodecahedron, great dodecicosahedron, great icosicosidodecahedron, small ditrigonal ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...