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:
“Whoever has a keen eye for profits, is blind in relation to his craft.”
—Sophocles (497–406/5 B.C.)
“The proper study of mankind is man in his relation to his deity.”
—D.H. (David Herbert)
“After decades of unappreciated drudgery, American women just don’t do housework any more—that is, beyond the minimum that is required in order to clear a path from the bedroom to the front door so they can get off to work in the mourning.”
—Barbara Ehrenreich (20th century)
“A certain degree of miserey [sic] seems inseparable from a high degree of populousness.”
—James Madison (1751–1836)