41. Every Directed Acyclic Graph has at least one sink vertex.
42. The topological sorting of any DAG can be done in . . . . . . . . time.
43. Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.
44. The column sum in an incidence matrix for a simple graph is . . . . . . . .
45. The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is . . . . . . . .
46. Which of the following is true?
47. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
48. In the given graph identify the cut vertices.
49. What would be the time complexity of the following function which adds an edge between two vertices i and j, with some weight 'weigh' to the graph having V vertices?
vector<int> adjacent[15] ;
vector<int> weight[15];
void addEdge(int i,int j,int weigh)
{
adjacent[a].push_back(i);
adjacent[b].push_back(j);
weight[a].push_back(weigh);
weight[b].push_back(weigh);
}
vector<int> adjacent[15] ;
vector<int> weight[15];
void addEdge(int i,int j,int weigh)
{
adjacent[a].push_back(i);
adjacent[b].push_back(j);
weight[a].push_back(weigh);
weight[b].push_back(weigh);
}50. Which of the following properties does a simple graph not hold?
Read More Section(Graphs)
Each Section contains maximum 100 MCQs question on Graphs. To get more questions visit other sections.