If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________

Question:If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________

1.the degree of each vertex is at most n/2

2.the degree of each vertex is equal to n

3.the degree of every vertex is at least n+1/2

4.the degree of every vertex in G is at least n/2


Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!