| Webster's Online Dictionary |
| Expressions | Domain | Definition | |
| Edge connectivity | Math | (1) The smallest number of edges whose deletion will cause a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of edges whose deletion will separate s from t. (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||
