Search Results for ""

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

Convergents of the pi continued fractions are the simplest approximants to pi. The first few are given by 3, 22/7, 333/106, 355/113, 103993/33102, 104348/33215, ... (OEIS ...

First published in Riemann's groundbreaking 1859 paper (Riemann 1859), the Riemann hypothesis is a deep mathematical conjecture which states that the nontrivial Riemann zeta ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...

A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...

257 is a Fermat prime, and the 257-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. An illustration of the 257-gon is not included ...

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...

An affine variety V is an algebraic variety contained in affine space. For example, {(x,y,z):x^2+y^2-z^2=0} (1) is the cone, and {(x,y,z):x^2+y^2-z^2=0,ax+by+cz=0} (2) is a ...