The minimum number of detours in a connected graph of minimum degree three

Xining Liu, Pu Qiao, Xingzhi Zhan

A longest path in a graph is called a detour. Denote by $a(k,n)$ the minimum number of detours in a connected graph with minimum degree $k$ and order $n,$ and denote by $b(k,n)$ th…