Adjacency Matrix MCQ

Test your knowledge with important Adjacency Matrix MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more Adjacency Matrix MCQs on Bissoy. Bissoy App

• 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.
  ক

  True

  খ

  False
• If A represents an adjacency matrix, which of these could be the value of x and y.
  ক

  represents an adjacency matrix, which of these could be the value of x and y. ] x=5, y=3

  খ

  x+3

  গ

  x+3

  ঘ

  x+3
• Given an adjacency matrix A = , , ], The total no. of ways in which every vertex can walk to itself using 2 edges is ________
  ক

  , , ], The total no. of ways in which every vertex can walk to itself using 2 edges is ________ ] 2

  খ

  [0, 1, 1

  গ

  [0, 1, 1

  ঘ

  [0, 1, 1
• Which of these adjacency matrices represents a simple graph? , , ] b) , , ] c) , , ] d) , , ]
  ক

  , , ] c) , , ] d) , , ] View Answer]

  খ

  [1, 0, 0

  গ

  [1, 0, 0

  ঘ

  [1, 0, 0
• In the given connected graph G, what is the value of rad(G) and diam(G)?
  ক

  2, 3

  খ

  3, 2

  গ

  2, 2

  ঘ

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

  Depends on the number of edges

  খ

  Depends on the number of vertices

  গ

  Is independent of both the number of edges and vertices

  ঘ

  It depends on both the number of edges and vertices
• What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?
  ক

  (n*(n-1))/2

  খ

  (n*(n+1))/2

  গ

  n*(n-1)

  ঘ

  n*(n+1)
• For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.
  ক

  in, out

  খ

  out, in

  গ

  in, total

  ঘ

  total, out
• The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________
  ক

  O(V)

  খ

  O(E2)

  গ

  O(E)

  ঘ

  O(V2)
• Adjacency matrix of all graphs are symmetric.
  ক

  False

  খ

  True
• What would be the number of zeros in the adjacency matrix of the given graph?
  ক

  10

  খ

  6

  গ

  16

  ঘ

  0
• The number of elements in the adjacency matrix of a graph having 7 vertices is __________
  ক

  7

  খ

  14

  গ

  36

  ঘ

  49