Q. An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?

View solution

Q. A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

View solution

Q. The maximum degree of any vertex in a simple graph with n vertices is

View solution

Q. The data structure required for Breadth First Traversal on a graph is

View solution

Q. In Breadth First Search of Graph, which of the following data structure is used?

View solution

Q. For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is

View solution

Q. A complete graph can have ...............

View solution

Q. Graph traversal is different from a tree traversal, because:

View solution

Q. The number of edges in a simple, n-vertex, complete graph is

View solution

Q. Graphs are represented using ............

View solution

Q. The spanning tree of connected graph with 10 vertices contains ..............

View solution

Q. If locality is a concern, you can use ................ to traverse the graph.

View solution

Q. Which of the following algorithms solves the all-pair shortest path problem?

View solution

Q. The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is

View solution

Q. Which of the following is useful in traversing a given graph by breadth first search?

View solution

Q. The minimum number of edges in a connected cyclic graph on n vertices is

View solution

Q. The number of edges in a regular graph of degree d and n vertices is

View solution

Q. In the given graph identify the cut vertices.

View solution

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

View solution

Q. The given Graph is regular.

View solution