Hey everybody. I want to know the difference, with examples, between a connected graph, a strongly connected graph and a biconnected graph in both directed and undirected graphs. Is a strongly connected graph a connected one?, is a biconnected graph a strongly connected graph?

Question

anonymous · Answer

connected graphs are those in which atleast one pair of nodes are connected with edges.strongly connected  graph is the one in which every nodes are connected or u can say that between every pair of nodes,there will exist atleast one path between.(path is interconnection of vertices and edges);then there is weakly connected graph in which atleast there is a node which is not connected or it is isolated