Search Results for ""

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

Propositional calculus is the formal basis of logic dealing with the notion and usage of words such as "NOT," "OR," "AND," and "implies." Many systems of propositional ...

A Proth number that is prime, i.e., a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. Factors of Fermat numbers are of this form as long as they ...

A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...

The pseudosphere is the constant negative-Gaussian curvature surface of revolution generated by a tractrix about its asymptote. It is sometimes also called the tractroid, ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

A pyramid is a polyhedron with one face (known as the "base") a polygon and all the other faces triangles meeting at a common polygon vertex (known as the "apex"). A right ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

An algebraic integer of the form a+bsqrt(D) where D is squarefree forms a quadratic field and is denoted Q(sqrt(D)). If D>0, the field is called a real quadratic field, and ...

If there is no integer 0<x<p such that x^2=q (mod p), i.e., if the congruence (35) has no solution, then q is said to be a quadratic nonresidue (mod p). If the congruence ...