Search Results for ""

A simple way to describe a knot projection. The advantage of this notation is that it enables a knot diagram to be drawn quickly. For an oriented alternating knot with n ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

A field is any set of elements that satisfies the field axioms for both addition and multiplication and is a commutative division algebra. An archaic name for a field is ...

A subset E of a topological space S is said to be of first category in S if E can be written as the countable union of subsets which are nowhere dense in S, i.e., if E is ...

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...

The fractional edge chromatic number of a graph G is the fractional analog of the edge chromatic number, denoted chi_f^'(G) by Scheinerman and Ullman (2011). It can be ...

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...

For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...

The values of -d for which imaginary quadratic fields Q(sqrt(-d)) are uniquely factorable into factors of the form a+bsqrt(-d). Here, a and b are half-integers, except for ...

A heptahedral graph is a polyhedral graph on seven nodes. There are 34 nonisomorphic heptahedral graphs, as first enumerated by Kirkman (1862-1863) and Hermes (1899ab, 1900, ...