Exercise 6:

Consider an undirected graph.

1. Explain what property of its adjacency matrix indicates that:

a) the graph is complete.

b) the graph has a loop, i.e., an edge connecting a vertex to itself.

c) the graph has an isolated vertex, i.e., a vertex with no edges incident to it.

2. Answer the same questions for the adjacency list representation.

((3+3+3)+(3+3+3))=18