Contents

-

Graphs of Diameter two Without Small Cycles

Taojun Lu 1
1Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario N2L 3Gi

Abstract

It is known that triangle-free graphs of diameter 2 are just maximal triangle-free graphs. Kantor ([5]) showed that if G is a triangle-free and 4-cycle free graph of diameter 2, then G is either a star or a Moore graph of diameter 2; if G is a 4-cycle free graph of diameter 2 with at least one triangle, then G is either a star-like graph or a polarity graph (defined from a finite projective plane with polarities) of order r2+r+1 for some positive integer r (or Pr-\emph{graph} for short). We study, by purely graph theoretical means, the structure of Pr-graphs and construct Pr-graphs for small values of r. Further, we characterize graphs of diameter 2 without 5-cycles and 6-cycles, respectively. In general, one can characterize Ck-free graphs of diameter 2 with k>6 with a similar approach.