Q. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.

View solution

Q. A ……….. is a graph that has weights of costs associated with its edges.

View solution

Q. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

View solution

Q. In a graph if e=[u, v], Then u and v are called

View solution

Q. A connected graph T without any cycles is called

View solution

Q. In a graph if e=(u, v) means

View solution

Q. If every node u in G is adjacent to every other node v in G, A graph is said to be

View solution

Q. Other name for directed graph is ..........

View solution

Q. Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

View solution

Q. A connected graph T without any cycles is called ........

View solution

Q. In a graph if E=(u,v) means ......

View solution

Q. Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:
I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices of G is always unique.
Which of the above statements is/are necessarily true?

View solution

Q. Let A be an adjacency matrix of a graph G. The ij th entry in the matrix Ak , gives

View solution

Q. For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

View solution

Q. An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?

View solution

Q. A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

View solution

Q. The maximum degree of any vertex in a simple graph with n vertices is

View solution

Q. The data structure required for Breadth First Traversal on a graph is

View solution

Q. In Breadth First Search of Graph, which of the following data structure is used?

View solution

Q. For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is

View solution