Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], The total no. of ways in which every vertex can walk to itself using 2 edges is . . . . . . . .

What is the primary difference between a directed graph and an undirected graph?

A. A directed graph has nodes with unique identifiers, while an undirected graph does not.

B. A directed graph has edges with direction, while an undirected graph does not.

C. There is no difference between them.

D. A directed graph has nodes with unique identifiers, while an undirected graph does not.

What is the time complexity of performing a depth-first search (DFS) on a graph using an adjacency matrix?

A. O(V log V)

B. O(E)

C. O(V²)

D. O(V + E)

Which of the following is true about a bipartite graph?

A. It contains a cycle of odd length.

B. It can be represented using only one adjacency list.

C. It has no edges.

D. It can be colored using two colors such that no two adjacent vertices share the same color.

What is a cycle in a graph?

A. A path that starts and ends at the same vertex with no other repetitions.

B. A path that includes all vertices exactly once.

C. A path with no edges.

D. A complete traversal of all vertices.