Search Results for ""

The Heath-Brown-Moroz constant is defined by C_(Heath-Brown-Moroz) = product_(p)(1-1/p)^7(1+(7p+1)/(p^2)) (1) = 0.00131764115... (2) (OEIS A118228), where the product is ...

Trigonometric functions of npi/9 radians for n an integer not divisible by 3 (e.g., 40 degrees and 80 degrees) cannot be expressed in terms of sums, products, and finite root ...

A number n such that the last digits of n^3 are the same as n. 49 is trimorphic since 49^3=117649 (Wells 1986, p. 124). The first few are 1, 4, 5, 6, 9, 24, 25, 49, 51, 75, ...

A uniquely Hamiltonian graph is a graph possessing a single Hamiltonian cycle. Classes of uniquely Hamiltonian graphs include the cycle graphs C_n, Hanoi graphs H_n, ladder ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

In the field of percolation theory, the term percolation threshold is used to denote the probability which "marks the arrival" (Grimmett 1999) of an infinite connected ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

17 is a Fermat prime, which means that the 17-sided regular polygon (the heptadecagon) is constructible using compass and straightedge (as proved by Gauss).