Question

A graph G is said to be _________ if there exists a path between every pair of vertices.


a.
Simple Graph


b.
Connected Graph


c.
Regular Graph


d.
Subgraph​

Answer 1

Answer:

Regular graph

Step-by-step explanation:

is correct answer