If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________
Posted: Thu Jul 14, 2022 9:05 am
a) the degree of each vertex is at most n/2
b) the degree of each vertex is equal to n
c) the degree of every vertex is at least n+1/2
d) the degree of every vertex in G is at least n/2
b) the degree of each vertex is equal to n
c) the degree of every vertex is at least n+1/2
d) the degree of every vertex in G is at least n/2