Search Results for ""

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

Unlike quadratic, cubic, and quartic polynomials, the general quintic cannot be solved algebraically in terms of a finite number of additions, subtractions, multiplications, ...

The mathematical study of the likelihood and probability of events occurring based on known information and inferred by taking a limited number of samples. Statistics plays ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

The function lambda(n)=(-1)^(Omega(n)), (1) where Omega(n) is the number of not necessarily distinct prime factors of n, with Omega(1)=0. The values of lambda(n) for n=1, 2, ...

The integer sequence 1, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 7, 5, 8, 7, 10, 8, 12, 10, 14, 12, 16, 14, 19, 16, 21, 19, ... (OEIS A005044) given by the coefficients of the ...

Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...

A number is squareful, also called nonsquarefree, if it contains at least one square in its prime factorization. The first few are 4, 8, 9, 12, 16, 18, 20, 24, 25, ... (OEIS ...