Search Results for ""

The chromatic invariant theta(G) of a connected graph G is the number of spanning trees of G that have internal activity 1 and external activity 0. For graphs other than the ...

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, ...

An articulation vertex of a connected graph, also called a cut-vertex (Harary 1994, p. 26; West 2000; Gross and Yellen 2006) or "cutpoint" (Harary 1994, p. 26), is a vertex ...

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 ...

An xyz embedding, also called an "xyz drawing," is a three-dimensional embedding such that every axis-parallel line contains either zero or two vertices. Such an embedding is ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

Let C_1, C_2, C_3, and C_4 be four circles of general position through a point P. Let P_(ij) be the second intersection of the circles C_i and C_j. Let C_(ijk) be the circle ...

Let sigma_1, ..., sigma_4 be four planes in general position through a point P and let P_(ij) be a point on the line sigma_i·sigma_j. Let sigma_(ijk) denote the plane ...

The symbol ∡ABC denotes the directed angle from AB to BC, which is the signed angle through which AB must be rotated about B to coincide with BC. Four points ABCD lie on a ...

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...