Sort 22 Discussions, By:
Please Login in order to post a comment
add more MCQs!!!
i didn't got any reward points for MCQs.
A tree is also a graph. The questino itself IMO is ambiguous. It should either say, minimum edges or maximum edges. Tree usually only suggests that it is connected. Cycle does not come into picture if it is undirected.
Trees are graphs that do not contain even a single cycle. They represent hierarchical structure in a graphical form. Trees belong to the simplest class of graphs. Despite their simplicity, they have a rich structure.
Trees provide a range of useful applications as simple as a family tree to as complex as trees in data structures of computer science.
A connected acyclic graph is called a tree. In other words, a connected graph with no cycles is called a tree.
The edges of a tree are known as branches. Elements of trees are called their nodes. The nodes without child nodes are called leaf nodes.
A tree with ‘n’ vertices has ‘n-1’ edges. If it has one more edge extra than ‘n-1’, then the extra edge should obviously has to pair up with two vertices which leads to form a cycle. Then, it becomes a cyclic graph which is a violation for the tree graph.
I am also facing the problem of green appearance of questionnas they haven't been solved