k-edge-connected graph

In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed.

The edge-connectivity of a graph is the largest k for which the graph is k-edge-connected.

单词	Edge connectivity
释义	Edge connectivity 英语百科 k-edge-connected graph In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed. The edge-connectivity of a graph is the largest k for which the graph is k-edge-connected.
随便看	Dendropanax proteus Dendropanax stellatus Dendropanax trifidus Dendropanax yunnanensis dendropathology dendrophagocytosis dendrophagous Dendrophagus dendrophenol dendrophile Dendrophilia dendrophilous Dendrophis dendrophnol Dendrophobia dendrophobias dendrophoma mori Dendrophthoe Dendrophthoe pentandra Dendrophtora DENDROPHYLIIDAE dendrophylliid dendrophylliids dendrophysis dendrophyte

Edge connectivity