Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightThe minimum number of edges required to create a cyclic graph of n ver...

The minimum number of edges required to create a cyclic graph of n ver...

  • Q. The minimum number of edges required to create a cyclic graph of n vertices is
  • filter_dramaExplanation
    Answer is : A
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. Number of vertices with odd degrees in a graph having a eulerian walk is ________
  • filter_dramaExplanation
    Answer is : D
    None.
  • 2. Which method of traversal does not use stack to hold nodes that are waiting to be processed?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. The output of Kruskal and Prims algorithm is ________________
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. All Graphs have unique representation on paper.
  • filter_dramaExplanation
    Answer is : B
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points