Minimum vertex‐diameter‐2‐critical graphs
Ya-chen Chen, Zoltán Füredi · Journal of Graph Theory · 2005
Abstract We prove that the minimum number of edges in a vertex‐diameter‐2‐critical graph on n ≥ 23 vertices is (5n − 17)/2 if n is odd, and is (5n/2) − 7 if n is even. © 2005 Wiley Periodicals, Inc. J Graph Theory