Graphs of order two less than the Moore bound Original Research Article

The problem of determining the largest order image of a graph of maximum degree at most d and diameter at most k is well known as the degree/diameter problem. It is known that image where image is the Moore bound. For image, the current best upper bound for image is image. In this paper we study properties of graphs of order image and we give a new upper bound for image for image.