Search Results for ""

The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...

65537 is the largest known Fermat prime, and the 65537-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. The 65537-gon has so many ...

Several differing definitions of almost planar (as well as nearly planar) have been used in the literature (cf. Lipton et al. 2016). For example, Gubser (1996) defines an ...

An articulation vertex of a connected graph, also called a cut-vertex (Harary 1994, p. 26; West 2000; Gross and Yellen 2006) or "cutpoint" (Harary 1994, p. 26), is a vertex ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...

Let each of f(a,b,c) and g(a,b,c) be a triangle center function or the zero function, and let one of the following three conditions hold. 1. The degree of homogeneity of g ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

An extension of two-valued logic such that statements need not be true or false, but may have a degree of truth between 0 and 1. Such a system can be extremely useful in ...

An adaptive Gaussian quadrature method for numerical integration in which error is estimation based on evaluation at special points known as "Kronrod points." By suitably ...