A graph in which at least one path (disregarding orientation) exists between any two nodes of the graph is a
A graph in which at least one path (disregarding orientation) exists between any two nodes of the graph is a Correct Answer connected graph
Concept:
- A graph is said to be a regular graph if all nodes connected with other nodes in the same manner, otherwise the graph will be non-regular.
- A graph is said to be a connected graph, if at least one branch must present between any two nodes of the graph otherwise it will be an unconnected graph.
- A graph is said to be a complete graph if every node in the graph is connected with every other node in the graph.
Example:
[ alt="F1 U.B 5.9.20 Pallavi D6" src="//storage.googleapis.com/tb-img/production/20/09/F1_U.B_5.9.20_Pallavi_D6.png" style="width: 134px; height: 142px;">
It is just a connected graph.
মোঃ আরিফুল ইসলাম
Feb 20, 2025