关于直径为2的最小图的一个猜测

A CONJECTUKE ON A MINIMAL GKAPH OF DIAMETER2

如果图Ｇ是ｎ个顶点的直径为２的最小图，ＺｏｌｔａｎＦｕｒｅｄｉ证明了当ｎ＞ｎ＿０时，｜Ｅ（Ｇ）｜≤［ｎ￣２／４］．本文研究的是他由此提出的一个猜测，证明了在ｋ＝２，３，条件加强的情况下，猜测成立，并讨论了上述猜测不成立的情形。

If the graph G of n vertices is the minimal graph of diameter 2,Zoltan Furediproved when n≥n_0, In this paper,we discuss a conjecture he dbtained fromthis,prove the conjecture is true when k=2,3 and in some added condition,and discuss theconjecture’s situation which is not true.