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:
“The whole point of Camp is to dethrone the serious. Camp is playful, anti-serious. More precisely, Camp involves a new, more complex relation to “the serious.” One can be serious about the frivolous, frivolous about the serious.”
—Susan Sontag (b. 1933)
“Only in a house where one has learnt to be lonely does one have this solicitude for things. One’s relation to them, the daily seeing or touching, begins to become love, and to lay one open to pain.”
—Elizabeth Bowen (1899–1973)
“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)
“I’ve always credited the private detective with a high degree of omniscience. Or is that only true in rental fiction?”
—John Paxton (1911–1985)