×

On diameter three distance degree regular graphs. (English) Zbl 1220.05031

Summary: This paper lists distance degree regular (DDR) graphs of diameter three with certain extremal degrees of regularity of the graphs. Determining DDR graphs of arbitrarily given degree of regularity seems difficult. However, the existence of such a graph of diameter three is assured in each regularity class.

MSC:

05C12 Distance in graphs
PDFBibTeX XMLCite
Full Text: Link