Search Results for ""

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...

If there is an integer 0<x<p such that x^2=q (mod p), (1) i.e., the congruence (1) has a solution, then q is said to be a quadratic residue (mod p). Note that the trivial ...

A Sierpiński number of the second kind is a number k satisfying Sierpiński's composite number theorem, i.e., a Proth number k such that k·2^n+1 is composite for every n>=1. ...

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...

An (ordinary) torus is a surface having genus one, and therefore possessing a single "hole" (left figure). The single-holed "ring" torus is known in older literature as 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 ...

There are at least two graphs associated with H. Walther. A graph on 25 vertices which appears somewhat similar to Tutte's fragment is implemented without discussion or ...