Activity: Talk or presentation › Oral presentation
Description
A triple (n, k, D) is said to be possible if a k-regular graph on n points with diameter D exists. For given k and D, we determine no, the smallest n for which (n, k, D) is possible. We also show that all (n, k, D) with no≤ n ≤ n1 and nk even are possible where n1 is an exponential function of D.