For r ≥ 4 we determine the smallest number of vertices, gr(d), of complete r-partite graphs that are decomposable into two isomorphic factors for a given finite diameter d. We also prove that for a given pair r, d such a graph exists for each order greater than gr(d).
|Original language||English (US)|
|Number of pages||14|
|Journal||Australasian Journal of Combinatorics|
|State||Published - Dec 1 1996|