Answers

1. 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:

   a. simple graph does not have parallel edges or self-loops. hence true

   b.  in a connected, directed graph, every node is reachable from all other nodes. hence true

   c.  there cannot be any cycle in a tree. hence true

   d.  if a graph g is a forest, then there is no cycle in g. hence true

   Learn more about Graphs here:

   brainly.com/question/19040584

   #SPJ4

   Log in to Reply