Q. A connected planar graph having 6 vertices, 7 edges contains _____________ regions.

View solution

Q. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________

View solution

Q. Which of the following properties does a simple graph not hold?

View solution

Q. What is the maximum number of edges in a bipartite graph having 10 vertices?

View solution

Q. Which of the following is true?

View solution

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

View solution

Q. For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

View solution

Q. A graph with all vertices having equal degree is known as a __________

View solution

Q. Which of the following ways can be used to represent a graph?

View solution

Q. The number of elements in the adjacency matrix of a graph having 7 vertices is __________

View solution

Q. What would be the number of zeros in the adjacency matrix of the given graph?

View solution

Q. Adjacency matrix of all graphs are symmetric.

View solution

Q. The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________

View solution

Q. For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.

View solution

Q. What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

View solution

Q. On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?

View solution

Q. In the given connected graph G, what is the value of rad(G) and diam(G)?

View solution

Q. Which of these adjacency matrices represents a simple graph?

View solution

Q. Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], how many ways are there in which a vertex can walk to itself using 2 edges.

View solution

Q. If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.

View solution