Q3,p2,d14. Consider the Graph shown below : This graph is a __________.

(A) Complete Graph (B) Bipartite Graph

(C) Hamiltonian Graph (D) All of the above 

Answer C 

explanation.

If each vertex of a connected graph with n vertices (where n> 3) is adjacent to at least n / 2 vertices, then the graph has a Hamilton circuit. Recall that two vertices are ADJACENT if there is an edge connecting them.

there are 6 vertices and and every vertex has atleast 3 neighbours hence hamiltonian graph.

Not complete graph because every vertices is not connected directly with every vertices.

Not bipartite because  in graph  whose vertices  can be divided into two disjoint  and U and Vsuch that every edges  connects a vertex inU to one inV