Question

A graph in which there exists a path between
any two of-its nodes is called a​

Answer 1

Answer:

A graph is called cyclic if there is a path in the graph which starts from a vertex and ends at the same vertex. That path is called a cycle. An acyclic graph is a graph which has no cycle. A tree is an undirected graph in which any two vertices are connected by only one path.

Answer 2

A​ connected graph: A graph is connected if and only if there is a path between any two of its nodes.

Explanation:

• Bidirectional path: In a bidirectional path between any two nodes, a path from any of the nodes to the other exists as well as a path from the other to one of the nodes.
• A​ bidirectional path contains at most two nodes.
• The graph is connected if and only if there is a path between any two of its nodes.
• Connected graphs are one-to-one maps of the nodes of a graph.
• The graph is connected if and only if there is a path between any two of its nodes.
• A path in a graph is simple if it does not repeatedly use the same edge to connect nodes.