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:
“Any relation to the land, the habit of tilling it, or mining it, or even hunting on it, generates the feeling of patriotism. He who keeps shop on it, or he who merely uses it as a support to his desk and ledger, or to his manufactory, values it less.”
—Ralph Waldo Emerson (18031882)
“Art should exhilarate, and throw down the walls of circumstance on every side, awakening in the beholder the same sense of universal relation and power which the work evinced in the artist, and its highest effect is to make new artists.”
—Ralph Waldo Emerson (18031882)
“After decades of unappreciated drudgery, American women just dont do housework any morethat 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)
“Men commonly couple with their idea of marriage a slight degree at least of sensuality; but every lover, the world over, believes in its inconceivable purity.”
—Henry David Thoreau (18171862)