Search Results for ""

In general, a tetrahedron is a polyhedron with four sides. If all faces are congruent, the tetrahedron is known as an isosceles tetrahedron. If all faces are congruent to an ...

The triangular number T_n is a figurate number that can be represented in the form of a triangular grid of points where the first row contains a single element and each ...

If an n-sided Poncelet transverse constructed for two given conic sections is closed for one point of origin, it is closed for any position of the point of origin. ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

The absolute value of a real number x is denoted |x| and defined as the "unsigned" portion of x, |x| = xsgn(x) (1) = {-x for x<=0; x for x>=0, (2) where sgn(x) is the sign ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

An alternating permutation is an arrangement of the elements c_1, ..., c_n such that no element c_i has a magnitude between c_(i-1) and c_(i+1) is called an alternating (or ...

Baillie and Wagstaff (1980) and Pomerance et al. (1980, Pomerance 1984) proposed a test (or rather a related set of tests) based on a combination of strong pseudoprimes and ...