Search Results for ""

Let X=(X,tau) be a topological vector space whose continuous dual X^* separates points (i.e., is T2). The weak topology tau_w on X is defined to be the coarsest/weakest ...

One of the numbers 1, 2, 3, ... (OEIS A000027), also called the counting numbers or natural numbers. 0 is sometimes included in the list of "whole" numbers (Bourbaki 1968, ...

A polyhex consisting of hexagons arranged along a line.

An n-component of a graph G is a maximal n-connected subgraph.

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

One billion (10^9) bytes. Unfortunately, the term is sometimes also used to mean 2^(30)=1024^3=1073741824 bytes. However, this usage is deprecated, and the term gibibyte is ...

An arc of a graph, sometimes also called a flag, is an ordered pair of adjacent vertices (Godsil and Royle 2001, p. 59), sometimes also called a directed line (Harary 1994, ...

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...

An ordering of permutations in which each two adjacent permutations differ by the transposition of two elements. For the permutations of {1,2,3} there are two listings which ...