The minimum number of edges in a vertex diameter-2-critical graph (Q1356444): Difference between revisions

A graph \(G\) is called vertex diameter-2-critical if \(\text{diam} (G)=2\) and \(\text{diam} (G-x)>2\) for each vertex \(x\) of the graph. The authors prove that such a graph of order \(n\geq 23\) has at least \((5n-17)/2\) edges. The proof is long and complicated. They also show that this bound is attained for infinitely many graphs.