Question

A connected sub graph containing all nodes of a graph but no closed path is known as​

Answer 1

Answer:

A connected subgraph containing all nodes of a graph but no closed path is known as​ a tree.

Explanation:

A tree is an associate subgraph of an associate graph containing all the nodes of the graph but containing no loops, i.e., there is a unique path in the middle of every pair of nodes. So, the number of closed paths in a tree of the graph is zero. A complete subgraph is a group of nodes for which all the nodes are associated with each other. Maximal complete subgraphs are the largest (i.e. those swallow the mass objects) of complete subgraphs.

Hence, the correct answer is a tree.

#SPJ3

Answer 2

A connected sub graph containing all nodes of a graph but no closed path is known as​ tree.

Explanation:

• A tree consists of the connected subgraph.
• Thus the connected graph contains all the nodes of the graph but it also contains no loops,
• So there is a unique path between each and every pair of nodes.
• Hence the number of closed paths in a tree of the graph is zero.
• The Maximal number of complete subgraphs is the largest with that of complete subgraphs. (i.e. those who swallow the mass objects)
• #SPJ1