Search Results for ""

The regular icosahedron (often simply called "the" icosahedron) is the regular polyhedron and Platonic solid illustrated above having 12 polyhedron vertices, 30 polyhedron ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

A ring in the mathematical sense is a set S together with two binary operators + and * (commonly interpreted as addition and multiplication, respectively) satisfying the ...

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

Triskaidekaphobia is the fear of 13, a number commonly associated with bad luck in Western culture. While fear of the number 13 can be traced back to medieval times, the word ...

An Abelian group is a group for which the elements commute (i.e., AB=BA for all elements A and B). Abelian groups therefore correspond to groups with symmetric multiplication ...

The Chebyshev polynomials of the first kind are a set of orthogonal polynomials defined as the solutions to the Chebyshev differential equation and denoted T_n(x). They are ...

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...

The number of digits D in an integer n is the number of numbers in some base (usually 10) required to represent it. The numbers 1 to 9 are therefore single digits, while the ...

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...