Search Results for ""

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

The coloring red of two complete subgraphs of n/2 points (for even n) in order to generate a blue-empty graph.

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

There are a number of attractive polyhedron compounds involving four cubes, several of which are illustrated above. The first (left figures), also known as Bakos' compound, ...

The cyclic group C_8 is one of the three Abelian groups of the five groups total of group order 8. Examples include the integers modulo 8 under addition (Z_8) and the residue ...

An algebraic identity is a mathematical identity involving algebraic functions. Examples include the Euler four-square identity, Fibonacci identity, Lebesgue identity, and ...

The point of concurrence of the four maltitudes of a cyclic quadrilateral. Let M_(AC) and M_(BD) be the midpoints of the diagonals of a cyclic quadrilateral ABCD, and let P ...

All triangles are bicentric, i.e., possess both an incircle and a circumcircle. This is not necessarily the case for polygons with four or more sides. The inradius r and ...