A. In complete graph, every vertex should have an edge to all other vertices.
- In given graph, there is no edge between D and B, A and C.
- Graph is not complete
B. If nodes in graph can be colored with just two colors, it is bipartitie.
- Suppose we colored A with red and all neighbours B, D, F with blue.
- But neighbours B, F and D,F are connected. So they cant have same color.
- It is not 2 colorable
- It is not bipartite
C. According to Dirac's theorem, in a graph of n nodes, if each node has degree greater than n/2, graph is Hamiltonian
- In given graph n =6
- All nodes have degree =4
- Hence graph is hamiltonian
- Sample Hamiltonian path is ABCDEF
Answer: c