Which of the following best describes a connected graph in graph theory?

a$)$ A graph with no cycles.

b$)$ A graph with no isolated vertices.

c$)$ A graph in which every pair of vertices is connected by a path.

d$)$ A graph in which every vertex has the same degree.