Question

prove that a graph with n vertices always has a Hamiltonian path if the sum of the degree of every pair of vertices vi ,vj in G satisfies the condition d(vi)+d(vj)>=n-1​

Answer 1

Answer:

you mean 2n-1 ? full degree sum for Each pair of vertices should be >= 2n-1 , BY definition .

Answer 2

if you get the answer so please share it with me.i really need most of your questions solution. please can any one help