K-edge-connected Graph - Relation To Minimum Vertex Degree

Relation To Minimum Vertex Degree

Minimum vertex degree gives a trivial upper bound on edge-connectivity. That is, if a graph G = (E,V) is k-edge-connected then it is necessary that k ≤ δ(G), where δ(G) is the minimum degree of any vertex vV. Obviously, deleting all edges incident to a vertex, v, would then disconnect v from the graph.

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

Famous quotes containing the words relation to, relation, minimum and/or degree:

    We must get back into relation, vivid and nourishing relation to the cosmos and the universe. The way is through daily ritual, and is an affair of the individual and the household, a ritual of dawn and noon and sunset, the ritual of the kindling fire and pouring water, the ritual of the first breath, and the last.
    —D.H. (David Herbert)

    The foregoing generations beheld God and nature face to face; we, through their eyes. Why should not we also enjoy an original relation to the universe? Why should not we have a poetry and philosophy of insight and not of tradition, and a religion by revelation to us, and not the history of theirs?
    Ralph Waldo Emerson (1803–1882)

    There are ... two minimum conditions necessary and sufficient for the existence of a legal system. On the one hand those rules of behavior which are valid according to the system’s ultimate criteria of validity must be generally obeyed, and on the other hand, its rules of recognition specifying the criteria of legal validity and its rules of change and adjudication must be effectively accepted as common public standards of official behavior by its officials.
    —H.L.A. (Herbert Lionel Adolphus)

    Unintelligent persons are like weeds that thrive in good ground; they love to be amused in proportion to the degree in which they weary themselves.
    Honoré De Balzac (1799–1850)