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