Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightMinimum number of spanning tree in a connected graph is

Minimum number of spanning tree in a connected graph is

  • Q. Minimum number of spanning tree in a connected graph is
  • filter_dramaExplanation
    Answer is : C
    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. The number of edges in a simple, n-vertex, complete graph is
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. A directed graph is
  • filter_dramaExplanation
    Answer is : B
    None.
  • 3. 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.
  • 4. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is
  • 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