Search Results for ""

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...

The Danzer configuration is a 35_4 self-dual configuration of 35 lines and 35 points in which 4 points lie on each line and 4 lines pass through each point. The Levi graph of ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...

An isolated point of a graph is a node of degree 0 (Hartsfield and Ringel 1990, p. 8; Harary 1994, p. 15; D'Angelo and West 2000, p. 212; West 2000, p. 22). The number of ...

The term "loop" has a number of meanings in mathematics. Most simply, a loop is a closed curve whose initial and final points coincide in a fixed point p known as the ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...

An example of a subspace of the Euclidean plane that is connected but not pathwise-connected with respect to the relative topology. It is formed by the ray y=0, x<=0 and the ...