COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Cyclic graph
|
|
|
Regular graph
|
|
|
Tree
|
|
|
Not a graph
|
Detailed explanation-1: -A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is known as a forest (i.e., a collection of trees).
Detailed explanation-2: -Another useful special class of graphs: Definition 5.5.1 A connected graph G is a tree if it is acyclic, that is, it has no cycles. More generally, an acyclic graph is called a forest.
Detailed explanation-3: -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.
Detailed explanation-4: -Explanation: An undirected graph G which is connected and acyclic is termed as a tree.
Detailed explanation-5: -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.