|
Organizers |
The maximum number of edges in a diameter 2-critical graph
by
Tiang Poomsa-ard
Khon Kaen University, Khon Kaen, Thailand
A graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge increases its diameter. We prove that if G is a diameter 2-critical graph on n vertices and e edges, then e <= \lfloor\frac14n2\rfloor.
Date received: April 10, 2001
Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Mathematical Conference Abstracts. Document # cags-17.