Search Results for ""

An n-uniform tessellation is a tessellation than has n transitivity classes of vertices. The 1-uniform tessellations are sometimes known as Archimedean tessellations. The ...

The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...

If each of two curves meets the line at infinity in distinct, nonsingular points, and if all their intersections are finite, then if to each common point there is attached a ...

Given the incircle and circumcircle of a bicentric polygon of n sides, the centroid of the tangent points on the incircle is a fixed point W, known as the Weill point, ...

Every even number is the difference of two consecutive primes in infinitely many ways (Dickson 2005, p. 424). If true, taking the difference 2, this conjecture implies that ...

d is called an e-divisor (or exponential divisor) of a number n with prime factorization n=p_1^(a_1)p_2^(a_2)...p_r^(a_r) if d|n and d=p_1^(b_1)p_2^(b_2)...p_r^(b_r), where ...

The letter O is used for a number of different purposes in mathematics. The double-struck O is sometimes used to represent octonions. The symbols O(x) (sometimes called the ...

The generalized hypergeometric function is given by a hypergeometric series, i.e., a series for which the ratio of successive terms can be written ...

The Klein bottle is a closed nonorientable surface of Euler characteristic 0 (Dodson and Parker 1997, p. 125) that has no inside or outside, originally described by Felix ...