Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightGraphs

Graphs MCQs

chevron_left Back Page 1/18 chevron_right Next
  • 1. In a graph if e=[u, v], Then u and v are called
  • filter_dramaExplanation
    Answer is : D
    None.
  • 2. A connected graph T without any cycles is called
  • filter_dramaExplanation
    Answer is : D
    None.
  • 3. In a graph if e=(u, v) means
  • filter_dramaExplanation
    Answer is : D
    None.
  • 4. . If every node u in G is adjacent to every other node v in G, A graph is said to be
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. Identify the correct problem for multistage graph from the list given below.
  • filter_dramaExplanation
    Answer is : A
    None.
  • 6. . Identify the correct problem for multistage graph from the list given below.
  • filter_dramaExplanation
    Answer is : A
    None.
  • 7. From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.
  • filter_dramaExplanation
    Answer is : A
    None.
  • 8. Minimum number of spanning tree in a connected graph is
  • filter_dramaExplanation
    Answer is : C
    None.
  • 9. Find the odd out
  • filter_dramaExplanation
    Answer is : C
    None.
  • 10. The minimum number of edges required to create a cyclic graph of n vertices is
  • filter_dramaExplanation
    Answer is : A
    None.
chevron_left Back Page 1/18 chevron_right Next
leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points