Diagraph MCQ

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

• G is an undirected graph with n vertices and 26 edges such that each vertex of G has a degree at least 4. Then the maximum possible value of n is ___________
  ক

  7

  খ

  43

  গ

  13

  ঘ

  10
• An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8?
  ক

  15

  খ

  8

  গ

  5

  ঘ

  23
• In a finite graph the number of vertices of odd degree is always ______
  ক

  even

  খ

  odd

  গ

  even or odd

  ঘ

  infinite
• Degree of a graph with 12 vertices is _______
  ক

  25

  খ

  56

  গ

  24

  ঘ

  212
• A simple graph can have _______
  ক

  multiple edges

  খ

  self loops

  গ

  parallel edges

  ঘ

  no multiple edges, self-loops and parallel edges
• Disconnected components can be created in case of ___________
  ক

  undirected graphs

  খ

  partial subgraphs

  গ

  disconnected graphs

  ঘ

  complete graphs
• What is a complete digraph?
  ক

  connection of nodes without containing any cycle

  খ

  connecting nodes to make at least three complete cycles

  গ

  start node and end node in a graph are same having a cycle

  ঘ

  connection of every node with every other node including itself in a digraph
• Let, D = <A, R> be a directed graph or digraph,then D’ = <A’, R’> is a subgraph if ___________
  ক

  A’ ⊂ A and R’ = R ∩ (A’ x A’)

  খ

  A’ ⊂ A and R ⊂ R’ ∩ (A’ x A’)

  গ

  R’ = R ∩ (A’ x A’)

  ঘ

  A’ ⊆ A and R ⊆ R’ ∩ (A’ x A’)
• A directed graph or digraph can have directed cycle in which ______
  ক

  starting node and ending node are different

  খ

  starting node and ending node are same

  গ

  minimum four vertices can be there

  ঘ

  ending node does not exist