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:

What is your question

MARK AS BRAINLIEST