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:
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)