Question

if there is a path between every two vertices of a graph G then G is called..............graph.​

Answer 1

Step-by-step explanation:

In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v. Otherwise, they are called disconnected. ... This means that there is a path between every pair of vertices. An undirected graph that is not connected is called disconnected.