Graph TheoryMediumEulerian and Hamiltonian Graphs
Eulerian and Hamiltonian Graphs · Medium problem
A graph has a clique on (all edges present among them), plus vertex joined only to and , plus vertex joined only to and ( vertices total). Among all pairs of NON-adjacent vertices, find the smallest value of .