Minimum Edge Cuts in Diameter 2 Graphs

Abstract

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.

Keywords

• edge connectivity
• diameter
• 05c40