A294733 Maximal diameter of connected (2*k)-regular graphs on 2*n+1 nodes written as triangular array T(n,k), 1 <= k <= n.

1, 2, 1, 3, 2, 1, 4, 2, 2, 1, 5, 4, 2, 2, 1, 6, 5, 2, 2, 2, 1, 7, 6, 4, 2, 2, 2, 1, 8

Offset: 1

Author

Hugo Pfoertner, Dec 14 2017

Keywords

• nonn
• tabl
• hard
• more

Comments

The results were found by applying the Floyd-Warshall algorithm to the output of Markus Meringer's GenReg program.

Examples

			Table starts:
Degree= 2   4   6   8  10  12  14  16
n= 3  : 1
n= 5  : 2   1
n= 7  : 3   2   1
n= 9  : 4   2   2   1
n=11  : 5   4   2   2   1
n=13  : 6   5   2   2   2   1
n=15  : 7   6   4   2   2   2   1
n=17  : 8 >=7 >=4   2   2   2   2   1
		

Links

• M. Meringer, Regular Graphs.
• M. Meringer, GenReg, Generation of regular graphs.
• StackOverflow, Algorithm for diameter of graph?.
• Wikipedia, Distance (graph theory).
• Wikipedia, Floyd-Warshall algorithm.

Crossrefs

Cf. A068934, A294732, A296524, A296525, A296526.