Search Results for ""

The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...

The honeycomb toroidal graph HTG(m,2n,s) on 2nm vertices for m, n, and s positive integers satisfying n>1 and m+s is even is defined as the graph on vertex set u_(ij) for ...

An incircle is an inscribed circle of a polygon, i.e., a circle that is tangent to each of the polygon's sides. The center I of the incircle is called the incenter, and the ...

The n-dimensional Keller graph, sometimes denoted G_n (e.g., Debroni et al. 2011), can be defined on a vertex set of 4^n elements (m_1,...,m_n) where each m_i is 0, 1, 2, or ...

The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...

The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...

The Laguerre polynomials are solutions L_n(x) to the Laguerre differential equation with nu=0. They are illustrated above for x in [0,1] and n=1, 2, ..., 5, and implemented ...

A wide variety of large numbers crop up in mathematics. Some are contrived, but some actually arise in proofs. Often, it is possible to prove existence theorems by deriving ...

A line is a straight one-dimensional figure having no thickness and extending infinitely in both directions. A line is sometimes called a straight line or, more archaically, ...

Linear algebra is the study of linear sets of equations and their transformation properties. Linear algebra allows the analysis of rotations in space, least squares fitting, ...