The following are the statements which are true to the following:
a. simple graph does not have parallel edges or self-loops.
b. in a connected, directed graph, every node is reachable from all other nodes.
c. there cannot be any cycle in a tree.
d. if a graph g is a forest, then there is no cycle in g.
We have the following:
a. a simple graph devoid of self-loops or parallel edges. consequently valid
b. In a directed, connected graph, every node may be reached from every other node. consequently valid
c. A tree cannot contain a cycle. consequently valid
d. If a graph g is a forest, then g does not include a cycle. consequently valid
Learn more about Graphs here:
brainly.com/question/19040584
#SPJ4
