A connected graph T without any cycles is called _____________.

Related Questions

• 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?
• Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• A connected planar graph having 6 vertices, 7 edges contains regions.
• For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
• Maximum degree in any vector in a graph with n vertices is ________.
• Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
• In a graph G if e=(u,v), then u and v are called ___________.
• Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
• The data structure required for Breadth First Traversal on a graph is?