An edge cut in graph theory is a set of edges whose removal increases the number of connected components of a graph, effectively disconnecting the graph. It is a fundamental concept in network design and analysis, as it helps in understanding the vulnerability and resilience of networks.