Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightA connected graph T without any cycles is called ........

A connected graph T without any cycles is called ........

  • Q. A connected graph T without any cycles is called ........
  • 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. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:
    I. Minimum Spanning Tree of G is always unique.
    II. Shortest path between any two vertices of G is always unique.
    Which of the above statements is/are necessarily true?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. When the Depth First Search of a graph is unique?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________
  • filter_dramaExplanation
    Answer is : D
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points