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.
英汉网英语在线翻译词典收录了3779314条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。