Search Results for ""

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

The Spencer-Brown form is a simple mathematical concept that formalizes what a mathematical object is formally identical to what it is not (Spencer-Brown 1997, pp. ix and ...

The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...

Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...

A general n-gonal antiprism is a polyhedron consisting of identical top and bottom n-gonal faces whose periphery is bounded by a band of 2n triangles with alternating up-down ...

The word "base" in mathematics is used to refer to a particular mathematical object that is used as a building block. The most common uses are the related concepts of the ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

The Boy surface is a nonorientable surface that is one possible parametrization of the surface obtained by sewing a Möbius strip to the edge of a disk. Two other ...