Q. Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________

View solution

Q. All Graphs have unique representation on paper.

View solution

Q. Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?

View solution

Q. What is the maximum possible number of edges in a directed graph with no self loops having 8 vertices?

View solution

Q. What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no cycles in the graph?

View solution

Q. Every Directed Acyclic Graph has at least one sink vertex.

View solution

Q. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

View solution

Q. The topological sorting of any DAG can be done in ________ time.

View solution

Q. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.

View solution

Q. Which of the given statement is true?

View solution

Q. For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?

View solution

Q. What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?

View solution

Q. In which of the following does a Directed Acyclic Word Graph finds its application in?

View solution

Q. What is time complexity to check if a string(length S1) is a substring of another string(length S2) stored in a Directed Acyclic Word Graph, given S2 is greater than S1?

View solution

Q. In which of the following case does a Propositional Directed Acyclic Graph is used for?

View solution

Q. Every Binary Decision Diagram is also a Propositional Directed Acyclic Graph.

View solution

Q. In a Propositional Directed Acyclic Graph Leaves maybe labelled with a boolean variable.

View solution

Q. Given Adjacency matrices determine which of them are PseudoGraphs?

i) {{1,0} {0,1}}

ii) {{0,1}{1,0}}

iii) {{0,0,1}{0,1,0}{1,0,0}}

View solution

Q. All undirected Multigraphs contain eulerian cycles.

View solution

Q. Determine the number of vertices for the given Graph or Multigraph?
G is a 4-regular Graph having 12 edges.

View solution