Which statements represent the properties of a tree according to the network graph theory ?

A1 : There exists only a single path between any pair of nodes.

A2 : The rank of a tree is similar to the rank of graph

A3: A tree does not contain any node on the graph

A4 : A tree comprises all closed paths

a. A1 & A2

b. A3 & A4

c. A1, A2 , A 3 & A4

d. None of the above

ANSWER: A1 & A2

Explanation:

Only the statements A1 & A2 satisfy the properties of a tree. The statements A3 & A4 are not precise because a tree contains all the nodes on the graph and does not contain any closed path.