Graph TheoryChallengeEulerian and Hamiltonian Graphs
Eulerian and Hamiltonian Graphs · Challenge problem
In the wheel (a hub joined to a -cycle, vertices), what is the smallest value of over non-adjacent pairs ?
In the wheel (a hub joined to a -cycle, vertices), what is the smallest value of over non-adjacent pairs ?