MathCastle
Graph TheoryMediumEulerian and Hamiltonian Graphs

Eulerian and Hamiltonian Graphs · Medium problem

A graph has a clique on {1,2,3,4,5,6}\{1,2,3,4,5,6\} (all 1515 edges present among them), plus vertex 77 joined only to 11 and 22, plus vertex 88 joined only to 33 and 44 (88 vertices total). Among all pairs of NON-adjacent vertices, find the smallest value of deg⁡(u)+deg⁡(v)\deg(u)+\deg(v).