Question

a. Graph, three vertices, two edges, not a tree.

Answer 1

Answer:

Take 3 vertices, form a loop over one vertex and match that vertex with another vertex. It did NOT say that graph CAN'T be disconnected. I hope you understand it.

Step-by-step explanation:

Vertex A: Make a loop. Join A with Vertex B.

Vertex B: Joined with A. Makes two edges.

Vertex c: Empty.

Graph is disconnected but still a Graph.