Graph MCQ

Test your knowledge with important Graph MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Graph MCQs at Bissoy

• Which of the following ways can be used to represent a graph?
  ক

  Adjacency List and Adjacency Matrix

  খ

  Incidence Matrix

  গ

  Adjacency List, Adjacency Matrix as well as Incidence Matrix

  ঘ

  No way to represent
• A graph with all vertices having equal degree is known as a __________
  ক

  Multi Graph

  খ

  Regular Graph

  গ

  Simple Graph

  ঘ

  Complete Graph
• For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
  ক

  1,2,3

  খ

  2,3,4

  গ

  2,4,5

  ঘ

  1,3,5
• 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?
  ক

  v=e

  খ

  v = e+1

  গ

  v + 1 = e

  ঘ

  v = e-1
• What is the maximum number of edges in a bipartite graph having 10 vertices?
  ক

  24

  খ

  21

  গ

  25

  ঘ

  16
• Which of the following properties does a simple graph not hold?
  ক

  Must be connected

  খ

  Must be unweighted

  গ

  Must have no loops or multiple edges

  ঘ

  Must have no multiple edges
• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
  ক

  (n*n-n-2*m)/2

  খ

  (n*n+n+2*m)/2

  গ

  (n*n-n-2*m)/2

  ঘ

  (n*n-n+2*m)/2
• A connected planar graph having 6 vertices, 7 edges contains _____________ regions.
  ক

  15

  খ

  3

  গ

  1

  ঘ

  11
• In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
  ক

  True

  খ

  False
• The given Graph is regular.
  ক

  True

  খ

  False
• What is the number of edges present in a complete graph having n vertices?
  ক

  (n*(n+1))/2

  খ

  (n*(n-1))/2

  গ

  n

  ঘ

  Information given is insufficient
• For the given graph(G), which of the following statements is true?
  ক

  G is a complete graph

  খ

  G is not a connected graph

  গ

  The vertex connectivity of the graph is 2

  ঘ

  The edge connectivity of the graph is 1
• In the given graph identify the cut vertices.
  ক

  B and E

  খ

  C and D

  গ

  A and E

  ঘ

  C and B
• Which of the following statements for a simple graph is correct?
  ক

  Every path is a trail

  খ

  Every trail is a path

  গ

  Every trail is a path as well as every path is a trail

  ঘ

  Path and trail have no relation