The graphs G1 and G2 with their incidences matrices given are Isomorphic.
e1 e2 e3 e4 e5 e6
v1 1 0 0 0 0 0
v2 1 1 0 0 0 1
v3 0 1 1 0 1 0
v4 0 0 1 1 0 0
v5 0 0 0 1 1 1
e1 e2 e3 e4 e5 e6
v1 0 0 1 0 0 0
v2 1 0 1 0 1 0
v3 1 1 0 1 0 0
v4 0 1 0 0 0 1
v5 0 0 0 1 1 1Select an option to see the answer and solution.
Which of the following symbols represent leaf nodes?
i. Δ
ii. ◊
iii. ∇
iv. T
v. ⊥ A. iv and v
B. v
C. i and iii
D. ii
Select an option to see the answer and solution.
The given Graph is regular.
Select an option to see the answer and solution.
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?
A. add all values by 10
B. subtract 10 from all the values
C. multiply all values by 10
D. in both the cases of multiplying and adding by 10
Select an option to see the answer and solution.
Adjacency matrix of all graphs are symmetric.
Select an option to see the answer and solution.
Consider the following symbols and choose which of the symbols represent nodes having atleast one child?
i. Δ
ii. ◊
iii. ∇
iv. T
v. ⊥ A. iv and v
B. iii, iv and v
C. i and ii
D. i and iii
Select an option to see the answer and solution.
All undirected Multigraphs contain eulerian cycles.
Select an option to see the answer and solution.
For the adjacency matrix of a directed graph the row sum is the . . . . . . . . degree and the column sum is the . . . . . . . . degree.
A. in, out
B. out, in
C. in, total
D. total, out
Select an option to see the answer and solution.
In the given graph which edge should be removed to make it a Bipartite Graph?
Select an option to see the answer and solution.
If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M.
Select an option to see the answer and solution.
Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is . . . . . . . .
A. O(E)
B. O(V*V)
C. O(E+V)
D. O(V)
Select an option to see the answer and solution.
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?
A. O(S1)
B. O(S2)
C. O(S1+S2)
D. O(1)
Select an option to see the answer and solution.
Determine the number of vertices for the given Graph or Multigraph?
A. 3
B. 6
C. 4
D. Information given is insufficient
Select an option to see the answer and solution.
Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of . . . . . . . .
A. O(V*V)
B. O(V*V*V)
C. O(E*V)
D. O(E*E)
Select an option to see the answer and solution.
Time complexity to check if an edge exists between two vertices would be . . . . . . . .
A. O(V*V)
B. O(V+E)
C. O(1)
D. O(E)
Select an option to see the answer and solution.
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
A. v=e
B. v = e+1
C. v + 1 = e
D. v = e-1
Select an option to see the answer and solution.
In the given connected graph G, what is the value of rad(G) and diam(G)?
Select an option to see the answer and solution.
All paths and cyclic graphs are bipartite graphs.
Select an option to see the answer and solution.
What would be the output of the following C++ program if the given input is
0 0 0 1 1
0 0 0 0 1
0 0 0 1 0
1 0 1 0 0
1 1 0 0 0
#include <bits/stdc++.h>
using namespace std;
bool visited[5];
int G[5][5];
void fun(int i)
{
cout<<i<<" ";
visited[i]=true;
for(int j=0;j<5;j++)
if(!visited[j]&&G[i][j]==1)
fun(j);
}
int main()
{
for(int i=0;i<5;i++)
for(int j=0;j<5;j++)
cin>>G[i][j];
for(int i=0;i<5;i++)
visited[i]=0;
fun(0);
return 0;
}A. 0 2 3 1 4
B. 0 3 2 4 1
C. 0 2 3 4 1
D. 0 3 2 1 4
Select an option to see the answer and solution.
What is the maximum number of edges in a bipartite graph having 10 vertices?
Select an option to see the answer and solution.
