# Connected Graph

A connected graph is a network for which there is a path between any pair of vertices.

Connected graph is a college-level concept that would be first encountered in a discrete mathematics course covering graph theory.

### Examples

Complete Graph: | A complete graph is a network in which every pair of vertices is connected by an edge. |

Cycle Graph: | A cycle graph is a network containing a single cycle which passes through all its vertices. |

Polyhedral Graph: | A polyhedral graph is a network made up of the vertices and edges of a polyhedron. Polyhedral graphs are always planar. |

Tree: | A tree is a network that contains no cycles. |

### Prerequisites

Graph: | In graph theory, a graph, also called a network, is a collection of points together with lines that connect some subset of the points. |