Search Results for ""

In a complete metric space, a countable union of nowhere dense sets is said to be meager; the complement of such a set is a residual set.

A set fixed within the framework of a theory and consisting of all objects considered in this theory. The complement of the universal set is the empty set.

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

The exterior of a knot K is the complement of an open solid torus knotted like K. The removed open solid torus is called a tubular neighborhood (Adams 1994, p. 258).

The mathematical study of the properties of the formal mathematical structures called graphs.

The (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...

The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...

The multiplicity of a multigraph is its maximum edge multiplicity.

The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...