Preparatory classes in Science and Technology OBJECTIVE OF GRAPH THEORY

• To model situations in the form of graphs;

• Find the best path in a graph;
• Decision-making assistance;

INFORMATIQUE 3 •
•
Looking for the best strategy;
Optimization (shortest path, GPS, minimum cost, task
scheduling ...);
Use cases:
• Transportation networks (highways, railroads,
http://www.larbiguezouli.com
subways, airlines ...);
• Energy transport (electricity, gas ...);
• Transport of information: internet, social networks ...
2
By Pr Larbi GUEZOULI

INTRODUCTION TO GRAPH
INFORMATIQUE 3
THEORY
• Introduction to graph theory [9 Courses + 9 TDs] 1. The concept of graphs
1. The concept of graphs
2. Basic algorithms in graph theory In everyday life, to explain a problem, we use a graph,
• The shortest path
• The flows for example: to draw a path, a family tree, the
3. The basic concepts of trees
organigram of an institution, ...
• Introduction to linear programming [6 Courses + 6 TDs]
1. The concept of linear programming (variables, constraints and This means that we are all familiar with the notion of
objective function) a graph.
2. Graphical solution of linear programming problems with two
variables We can say that a graph is a method of thinking that
3. Solving linear problems by the simplex method
allows for modeling a problem.
4. Duality: Definitions and basic concepts
Evaluation:
Interrogations
Homework
Practical work
Final exam 3 4
 INTRODUCTION TO GRAPH
THEORY
1. The concept of graphs (next)
Example: Leonhard Euler posed a walking problem in
his city Königsberg (today called Kaliningrad) in Russia.
INTRODUCTION TO GRAPH
THEORY
1. The concept of graphs (next)
He tries to find out if he can walk through the
streets of Königsberg passing once and only once over
each bridge, and return to his starting point.

He showed that he could not make such a walk by

characterizing graphs (now called Eulerian graphs).

Leonhard Euler
(1707-1783)

5 6

INTRODUCTION TO GRAPH INTRODUCTION TO GRAPH

THEORY
1. The concept of graphs (next)
Let’s see some definitions before continuing in this
course.
1.1.Definitions of a graph
A graph G is defined by two sets: S={s0, s1, ..., sn} set
of nodes (vertices) and A={a1, a2, ..., am} set of edges.
THEORY
1.1. Definitions of a graph (next)
Or: a graph is a finite set of points called vertices,
nodes or cells. These are connected by links called
edges (or arcs).

7 8
 INTRODUCTION TO GRAPH INTRODUCTION TO GRAPH
THEORY THEORY
1.2. Graph properties 1.2. Graph properties (next)

The order of a graph is the number of nodes The degree of a node (vertex) is the number of
(vertices) in the graph. edges having an endpoint at that node. For example, the
A loop is an edge connecting a node (vertex) to itself. nodes of the following graph are all of degree 3.
An isolated node (vertex) is a node not connected to
other nodes.
Two nodes (vertices) are adjacent if they are
connected by an edge.
An arc is an oriented edge.

9 10

INTRODUCTION TO GRAPH INTRODUCTION TO GRAPH

THEORY THEORY
1.2. Graph properties (next) 1.3. Some definitions
Before looking at the types of graphs we need to define
An isolated vertex is a vertex of degree zero some concepts.
(without connected edges). An isthmus is an edge whose removal increases the
number of connected components.
A pendant vertex is a vertex of degree 1 (connected
2 1 2 1
to a single edge).
6 3 6 3
isolated

5 4 5 4

pendant isthmus
11 12
 INTRODUCTION TO GRAPH INTRODUCTION TO GRAPH
THEORY THEORY
1.3. Some definitions (next) 1.3. Some definitions (next)
An articulation point is a vertex such that its deletion The connectivity
increases the number of connected components of the An undirected connected graph is a graph where from
initial graph. a vertex we can join all the other vertices.
For a directed graph, we talk about connectivity if we
Articulation point ignore the orientation of the edges, the graph becomes
2 1
connected.
6 3 We distinguish 2 types of connectivity: strongly
connected and weakly connected (sections: 1.4.4 and 1.4.5)
5 4
An unconnected graph is decomposed into several
connected components.

13 14

INTRODUCTION TO GRAPH INTRODUCTION TO GRAPH

THEORY
The connectivity (next)
Exp. G = (S, A) is a disconnected graph with
S={1,2,3,4,5,6} and A={(1,3), (1,4), (3,4), (2,5), (2,6)}.
It contains 2 connected components:
S1={1,3,4}; A1={(1,3), (1,4), (3,4)}.
S2={2,5,6}; A2={(2,5), (2,6)}.
THEORY
1.3. Some definitions (next)
A chain is an ordered sequence of edges such that
each edge has one end in common with the next edge.
An elementary chain does not pass through the same
vertex twice.
A simple chain does not use the same edge twice.

2 1

6 3

5 4
Disconnected graph 15 16
 INTRODUCTION TO GRAPH INTRODUCTION TO GRAPH
THEORY THEORY
1.3. Some definitions (next) 1.3. Some definitions (next)
A path is a chain such that the terminal end of an arc A cycle is a simple chain whose end vertices coincide.
coincides with the initial end of the next arc. A circuit is a path whose initial node is the terminal
The first vertex of the path is called the initial node node. We can say that a loop is a circuit of length 1.
of the path, and the last is called the terminal node.
Initial and
Initial node 1 2 Initial and terminal node 1 2
terminal node 1 2

5 Terminal node 5
5
3 4 3 4
3 4

Path (1,2,5) Cycle (1,2,5,4,3,1)

17
Circuit (1,2,5,4,3,1) 18

INTRODUCTION TO GRAPH INTRODUCTION TO GRAPH

THEORY THEORY
1.4. Some types of graphs 1.4. Some types of graphs (next)
1.4.1. Simple graph 1.4.3. Complete graph
It is a graph without loops and between two vertices A complete graph with n vertices (denoted Kn) is a
there is at most one edge. graph with n vertices for which each vertex is
1.4.2. Multigraph connected to all others.
A multigraph is a graph for which there can be Exp. G = (S, A) is a complete graph (denoted K3) with
several edges between two vertices or loops. S={1,2,3} and A={(1,2), (1,3), (2,3)}.
1 1 1

2 3 2 3 3 Complete graph

4 4 2
Simple graph 19 20
Multigraph
 INTRODUCTION TO GRAPH INTRODUCTION TO GRAPH
THEORY THEORY
1.4. Some types of graphs (next) 1.4. Some types of graphs (next)
1.4.4. Strongly connected graph 1.4.5. Weakly connected graph
An oriented graph is strongly connected if there is a An oriented graph is weakly connected if there is a
path between every two vertices in both directions. chain between any pair of vertices without considering
Exp. G = (S, A) is a strongly connected graph with the orientation of the arcs.
S={1,2,3,4,5} and A={(1,2), (2,4), (4,3), (3,1), (2,5), (5,4)}. Exp. G = (S, A) is a weakly connected graph with
S={1,2,3,4,5} et A={(1,2), (2,4), (4,3), (3,1), (2,5), (5,4)}.

1 2
1 2
Weakly connected graph 5
Strongly connected graph 5
3 4
3 4 21 22