Minimum vertex-diameter-2-critical graphs

Ya Chen Chen, Zoltán Füredi

Research output: Contribution to journalArticle

7 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)293-315
Number of pages23
JournalJournal of Graph Theory
Issue number4
Publication statusPublished - Dec 2005


  • Diameter 2
  • Extremal graphs
  • Vulnerability

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Minimum vertex-diameter-2-critical graphs'. Together they form a unique fingerprint.

  • Cite this