K-edge-connected Graph - Formal Definition

Formal Definition

Let G = (E,V) be an arbitrary graph. If G' = (E \ X,V) is connected for all XE where |X| < k, then G is k-edge-connected. Trivially, a graph that is k-edge-connected is also (k−1)-edge-connected.

Read more about this topic:  K-edge-connected Graph

Famous quotes containing the words formal and/or definition:

    There must be a profound recognition that parents are the first teachers and that education begins before formal schooling and is deeply rooted in the values, traditions, and norms of family and culture.
    Sara Lawrence Lightfoot (20th century)

    The definition of good prose is proper words in their proper places; of good verse, the most proper words in their proper places. The propriety is in either case relative. The words in prose ought to express the intended meaning, and no more; if they attract attention to themselves, it is, in general, a fault.
    Samuel Taylor Coleridge (1772–1834)