Search Results for ""

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...

The regular tetrahedron, often simply called "the" tetrahedron, is the Platonic solid with four polyhedron vertices, six polyhedron edges, and four equivalent equilateral ...

A triangle is a 3-sided polygon sometimes (but not very commonly) called the trigon. Every triangle has three sides and three angles, some of which may be the same. The sides ...

The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...

The Jacobi elliptic functions are standard forms of elliptic functions. The three basic functions are denoted cn(u,k), dn(u,k), and sn(u,k), where k is known as the elliptic ...

The Euler-Mascheroni constant gamma, sometimes also called 'Euler's constant' or 'the Euler constant' (but not to be confused with the constant e=2.718281...) is defined as ...

The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...

The number of ways a set of n elements can be partitioned into nonempty subsets is called a Bell number and is denoted B_n (not to be confused with the Bernoulli number, ...

Count the number of lattice points N(r) inside the boundary of a circle of radius r with center at the origin. The exact solution is given by the sum N(r) = ...