Quiz 8 - Graphs

Which of the following as adjacency matrix of an undirected graph G, the number of bridge(s) is

3

Does a path exist from A to D? If so, list one such path.

A > C > D

Does a path exist from A to D? If so, list one such path.

A > C > E > D

Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?

All of the above -Adding a vertex in adjacency list representation is easier than adjacency matrix representation. -DFS and BSF can be done in O(V + E) time for adjacency list representation. These operations take O(V^2) time in adjacency matrix representation. Here is V and E are number of vertices and edges respectively. -Cross In adjacency list representation, space is saved for sparse graphs.

For the given graph(G), which of the following statements is true?

The vertex connectivity of the graph is 2

The graph represented by the Adjacency Matrix is

directed

An adjacency matrix representation of a graph cannot contain information of:

direction of edges

The graph represented by the Adjacency List is

undirected

If the graph is undirected, the degree of vertex A is: if the graph is directed, the in-degree of vertex A is : if the graph is directed, the out-degree of vertex A is:

vertex A degree: 3