Search Results for ""

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

A plane curve proposed by Descartes to challenge Fermat's extremum-finding techniques. In parametric form, x = (3at)/(1+t^3) (1) y = (3at^2)/(1+t^3). (2) The curve has a ...

A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...

Pick any two relatively prime integers h and k, then the circle C(h,k) of radius 1/(2k^2) centered at (h/k,+/-1/(2k^2)) is known as a Ford circle. No matter what and how many ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

In mathematics, a formal language is normally defined by an alphabet and formation rules. The alphabet of a formal language is a set of symbols on which this language is ...

Consider the Euclid numbers defined by E_k=1+p_k#, where p_k is the kth prime and p# is the primorial. The first few values of E_k are 3, 7, 31, 211, 2311, 30031, 510511, ... ...

Four-dimensional geometry is Euclidean geometry extended into one additional dimension. The prefix "hyper-" is usually used to refer to the four- (and higher-) dimensional ...