Search Results for ""

An edge cut (Holton and Sheehan 1993, p. 14; West 2000, p. 152), edge cut set, edge cutset (Holton and Sheehan 1993, p. 14), or sometimes simply "cut set" or "cutset" (e.g., ...

The gonality (also called divisorial gonality) gon(G) of a (finite) graph G is the minimum degree of a rank 1 divisor on that graph. It can be thought of as the minimum ...

Petersen's theorem states that every cubic graph with no bridges has a perfect matching (Petersen 1891; Frink 1926; König 1936; Skiena 1990, p. 244). In fact, this theorem ...

A fullerene is a cubic polyhedral graph having all faces 5- or 6-cycles. Examples include the 20-vertex dodecahedral graph, 24-vertex generalized Petersen graph GP(12,2), ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

Bowling, known as "ten pins" throughout most of the world, is a game played by rolling a heavy ball down a long narrow track and attempting to knock down ten pins arranged in ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

A node which is one graph edge further away from a given node in a rooted tree.

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.