Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightFor a given graph G having v vertices and e edges which is connected a...

For a given graph G having v vertices and e edges which is connected a...

  • Q. 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?
  • filter_dramaExplanation
    Answer is : B
    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. A connected graph T without any cycles is called ........
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. When the Breadth First Search of a graph is unique?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 3. In Depth First Search, how many times a node is visited?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. kruskal algorithm is based on ___________method
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. Find the odd out
  • filter_dramaExplanation
    Answer is : C
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points