---
type: "concept"
title: "Connected graph"
slug: "connected-graph"
language: "en"
translationGroupId: "cmrsvyitt0005uj01dpl2quee"
domain: "Combinatorics"
status: "usable"
aliases: []
lastEditedBy: "ancient-tree"
---

A [[graph|graph]] is said to be connected if and only if for any pair of vertices of this graph, there exists a sequence of adjacent edges that connect the first vertex to the second.

If the graph is [[Directed graph|directed]], one adds the condition that this path also need to be directed.