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

Q. In the following DAG find out the number of required Stacks in order to represent it in a Graph Structured Stack.

View solution

Q. Which of the following graphs are isomorphic to each other?

View solution

Q. In the given graph which edge should be removed to make it a Bipartite Graph?

View solution

Q. What would be the DFS traversal of the given Graph?

View solution

Q. What is the number of words that can be formed from the given Directed Acyclic Word Graph?

View solution

Q. Determine the longest string which is described by the given Directed Acyclic Word Graph.

View solution

Q. Which of the following statements for a simple graph is correct?

View solution

Q. What is the number of edges present in a complete graph having n vertices?

View solution

Q. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.

View solution

Q. A connected planar graph having 6 vertices, 7 edges contains _____________ regions.

View solution

Q. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________

View solution

Q. Which of the following properties does a simple graph not hold?

View solution