K-edge-connected Graph
In graph theory, a graph is k-edge-connected if it remains connected whenever fewer than k edges are removed.
Read more about K-edge-connected Graph: Formal Definition, Relation To Minimum Vertex Degree, Computational Aspects
Famous quotes containing the word graph:
“In this Journal, my pen is a delicate needle point, tracing out a graph of temperament so as to show its daily fluctuations: grave and gay, up and down, lamentation and revelry, self-love and self-disgust. You get here all my thoughts and opinions, always irresponsible and often contradictory or mutually exclusive, all my moods and vapours, all the varying reactions to environment of this jelly which is I.”
—W.N.P. Barbellion (1889–1919)