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 v ∈ V. 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:
“To be a good enough parent one must be able to feel secure in ones parenthood, and ones relation to ones child...The security of the parent about being a parent will eventually become the source of the childs feeling secure about himself.”
—Bruno Bettelheim (20th century)
“You see, I am alive, I am alive
I stand in good relation to the earth
I stand in good relation to the gods
I stand in good relation to all that is beautiful
I stand in good relation to the daughter of Tsen-tainte
You see, I am alive, I am alive”
—N. Scott Momaday (b. 1934)
“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 systems 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)
“One who shows signs of mental aberration is, inevitably, perhaps, but cruelly, shut off from familiar, thoughtless intercourse, partly excommunicated; his isolation is unwittingly proclaimed to him on every countenance by curiosity, indifference, aversion, or pity, and in so far as he is human enough to need free and equal communication and feel the lack of it, he suffers pain and loss of a kind and degree which others can only faintly imagine, and for the most part ignore.”
—Charles Horton Cooley (18641929)