Search Results for ""

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 ...

Given two intersecting lines or line segments, the amount of rotation about the point of intersection (the vertex) required to bring one into correspondence with the other is ...

A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The ...

The 13 Archimedean solids are the convex polyhedra that have a similar arrangement of nonintersecting regular convex polygons of two or more different types arranged in the ...

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 ...

Ball triangle picking is the selection of triples of points (corresponding to vertices of a general triangle) randomly placed inside a ball. n random triangles can be picked ...

The Beatty sequence is a spectrum sequence with an irrational base. In other words, the Beatty sequence corresponding to an irrational number theta is given by |_theta_|, ...

A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

Define a carefree couple as a pair of positive integers (a,b) such that a and b are relatively prime (i.e., GCD(a,b)=1) and a is squarefree. Similarly, define a strongly ...