The order-degree problem is to find the smallest diameter of graphs given order and maximum degree.
If there are multiple graphs which take the minimum diameter, a graph which has minimum average shortest path length (ASPL) will be the solution.
Like the degree-diameter problem, there is known lower bound to this problem.
The order-degree problem can be applied to practical use such as constructing low-latency computer network.
An international competition for finding solutions of the order-degree problem Graph Golf has been held annually since 2015.
Graph Bank incorporates solutions from Graph Golf.