Extremal regular graphs under prescribed degree constraints

Determine whether a regular graph maximizes or minimizes the subpath number among graphs with prescribed maximum degree or prescribed minimum degree, and characterize the maximal and minimal graphs with respect to the subpath number within the class of r-regular graphs.

Background

The paper proves that adding an edge strictly increases the subpath number and consequently identifies trees and complete graphs as the minimum and maximum, respectively, among connected graphs with a fixed number of vertices. It also determines the extremal complete bipartite graph among bipartite graphs.

These monotonicity arguments do not directly resolve extremal problems when degree constraints are imposed. The authors specifically focus attention on regular graphs, with cubic graphs identified as the first nontrivial case after the already-understood 2-regular case.

References

Moreover, since the addition of an edge strictly increases the subpath number, an interesting question is whether a regular graph maximizes (resp. minimizes) the subpath number among all graphs with prescribed maximum degree (resp. minimum degree). This focuses one's attention to regular graphs and the question which graphs are maximal and which are minimal with respect to the subpath number in the class of $r$-regular graph.

— Invitation to the subpath number  (2503.00558 - Knor et al., 1 Mar 2025) in Section 1, Introduction; Section 6, Concluding remarks and further work