Data Structures :: Graphs

 Which of the following is an invalid path for the following graph?

 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?

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

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

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

 Let A be an adjacency matrix of a graph G. The ij entry in the matrix A^k , gives

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

 An adjacency matrix representation of a graph cannot contain information of :

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

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