Search Results for ""

There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

A plot of equipotential curves. If desired, the regions between contours can be shaded or colored to indicate their magnitude. Contour plots are implemented in the Wolfram ...

The Cookson Hills series is the series similar to the Flint Hills series, but with numerator sec^2n instead of csc^2n: S_2=sum_(n=1)^infty(sec^2n)/(n^3) (Pickover 2002, p. ...

The cornoid is the curve illustrated above given by the parametric equations x = acost(1-2sin^2t) (1) y = asint(1+2cos^2t), (2) where a>0. It is a sextic algebraic curve with ...

The cototient of a positive number n is defined as n-phi(n), where n is the totient function. It is therefore the number of positive integers <=n that have at least one prime ...

A positive integer: 1, 2, 3, 4, ... (OEIS A000027), also called a natural number. However, zero (0) is sometimes also included in the list of counting numbers. Due to lack of ...

A family gamma of nonempty subsets of X whose union contains the given set X (and which contains no duplicated subsets) is called a cover (or covering) of X. For example, ...

An infinite sequence of circles such that every four consecutive circles are mutually tangent, and the circles' radii ..., R_(-n), ..., R_(-1), R_0, R_1, R_2, R_3, R_4, ..., ...

A nonplanar graph G is said to be critical nonplanar if the removal of a vertex results in a planar graph for every vertex of G. Critical nonplanar graphs differ from apex ...