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

Q. Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.

View solution

Q. Given the following adjacency matrix of a graph(G) determine the number of components in the G.

[0 1 1 0 0 0],

[1 0 1 0 0 0],

[1 1 0 0 0 0],

[0 0 0 0 1 0],

[0 0 0 1 0 0],

[0 0 0 0 0 0].

View solution

Q. Incidence matrix and Adjacency matrix of a graph will always have same dimensions?

View solution

Q. The column sum in an incidence matrix for a simple graph is __________

View solution

Q. What are the dimensions of an incidence matrix?

View solution

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