Improved bound on the number of edges of diameter-$k$-critical graphs

Xiaolin Wang, Yanbo Zhang, Xiutao Zhu

A graph is diameter-$k$-critical if its diameter equals $k$ and the deletion of any edge increases its diameter. The Murty-Simon Conjecture states that for any diameter-2-critical…