Q. The column sum in an incidence matrix for a directed graph having no self loop is __________

View solution

Q. Time complexity to check if an edge exists between two vertices would be ___________

View solution

Q. 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 1

View solution

Q. If a connected Graph (G) contains n vertices what would be the rank of its incidence matrix?

View solution

Q. A Graph Structured Stack is a _____________

View solution

Q. If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?

View solution

Q. Graph Structured Stack finds its application in _____________

View solution

Q. 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.

View solution

Q. Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________

View solution

Q. For some sparse graph an adjacency list is more space efficient against an adjacency matrix.

View solution

Q. Time complexity to find if there is an edge between 2 particular vertices is _________

View solution

Q. For the given conditions, which of the following is in the correct order of increasing space requirement?
i) Undirected, no weight

ii) Directed, no weight

iii) Directed, weighted

iv) Undirected, weighted

View solution

Q. Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________

View solution

Q. In which case adjacency list is preferred in front of an adjacency matrix?

View solution

Q. To create an adjacency list C++’s map container can be used.

View solution

Q. Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?

View solution

Q. Number of vertices with odd degrees in a graph having a eulerian walk is ________

View solution

Q. How many of the following statements are correct?
i) All cyclic graphs are complete graphs.

ii) All complete graphs are cyclic graphs.

iii) All paths are bipartite.

iv) All cyclic graphs are bipartite.

v) There are cyclic graphs which are complete.

View solution

Q. All paths and cyclic graphs are bipartite graphs.

View solution

Q. What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.

View solution