Discrete Mathsfor Engineers

Structures, proofs, and intuition

EN | PT

Graph Theory → Foundations

Part 3 of 11 — Graph

Series: Foundations Part 3 of 11
1 2 3 4 5 6 7 8 9 10 11

Intuition

A graph is a set of vertices connected by edges.

A B C D E
Example of an undirected graph with five vertices.

Notation

Let \(G=(V,A)\), where:

  • \(V=\{A,B,C,D,E\}\) is the set of vertices;
  • \(A\) is the set of edges (unordered pairs of vertices).

In this example, one possible edge set is:

\[ A=\{\{A,B\},\{B,C\},\{A,C\},\{A,D\},\{C,D\},\{B,E\},\{D,E\}\} \]