0 votes 0 votes A graph G is called a ________ if it is a connected acyclic graph. Cyclic graph Regular graph Tree Not a graph Unknown Category uttarakhand-asst-prof-2018 + – gatecse asked Mar 2, 2018 edited Mar 6, 2018 by Sukanya Das gatecse 7.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes A graph G is called a Tree if it is a connected acyclic graph. A tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any acyclic connected graph is a tree. ∴ Tree is a connected graph that has no cycles. Forest is an acyclic graph. Every component of a forest is a tree. Sukanya Das answered Mar 3, 2018 edited Mar 6, 2018 by Sukanya Das Sukanya Das comment Share Follow See all 0 reply Please log in or register to add a comment.