Question 13093 – HCU PHD CS MAY 2014
May 16, 2024Question 1292 – Data-Structures
May 16, 2024UGC NET CS 2017 Jan -paper-2
| Question 5 |
Consider a Hamiltonian Graph G with no loops or parallel edges and with |V(G)| = n ≥ 3. Then which of the following is true ?
| deg(v) ≥n/2 for each vertex v. | |
| |E(G)| ≥1/2(n – 1) (n – 2) + 2 | |
| deg (v) + deg(w) ≥ n whenever v and w are not connected by an edge | |
| All of the above |
Question 5 Explanation:
With the help of dirac’s theorem, we can prove above three statements.
Correct Answer: D
Question 5 Explanation:
With the help of dirac’s theorem, we can prove above three statements.
Subscribe
Login
0 Comments