Answers are grounded in this paper and cite their sources.
This note treats the existence of connected, undirected graphs homogeneous of degree d and of diameter k, having a number of nodes which is maximal according to a certain definition. For k = 2 unique graphs exist for d = 2,3,7 and possibly for d = 57 (which is undecided), but for no other degree. For k = 3 a graph exists only for d = 2. The proof exploits the characteristic roots and vectors of the adjacency matrix (and its principal submatrices) of the graph.
No takes yet. Share an insight, caveat, or question.
Hoffman et al. (1960) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: