Minimum edge cuts in diameter 2 graphs
Allan Bickle, Allen J. Schwenk · Discussiones Mathematicae Graph Theory · 2018
Plesnik proved that the edge connectivity and minimum degree are equal for diameter 2 graphs. We provide a streamlined proof of this fact and characterize the diameter 2 graphs with a nontrivial minimum edge cut.