‫وزارة التعليم العالي والبحث‬

‫المديرية‬
‫العلمي‬
‫العامة للتربية‬
‫جامعة الكوفة‬
‫في محافظة‬
‫مركز التعليم‬
‫النجف االشرف‬ ‫من‬ ‫المستمر مفاهيم اساسية‬
‫الرسوم البيانية‬
‫‪Basic concepts of graph‬‬
‫محاضرة مقدمة ا;;لىق;;سم; ا;;لتعليم;‬
‫ندى هادي‬
‫ا;;لمستمر ف;;;يج;امع;ة ا;;لكوفة ا;;لدورة ا;;لسابع;ة‬
‫مالك‬

‫هـ‪1442‬‬ ‫م‪2021‬‬
Content
• Introduction

• Simple graph

• The adjacent and incident

• Subgraph

• Some operation on the graph

• Certain types of graph

Introduction
Graph theory may be said to have its beginning in 1736 when
Euler consider the (general case of the ) Konigsberg bridge
problem : does there exist a walk crossing each of the seven
bridges of konigsberg exactly ones ? In took 200 years before
the first book of graph theory was written

This was by KONIG in 1936 . Since the graph theory has

developed into an extensive and popular branch of
mathematics , Which has been applied to many problems in
mathematics , other names are used for molecular structures in
chemistr
 Basic concepts of graphs

Definition 1.1[1]
A graph is a pair G=(V,E) of sets satisfying E⊇ [V] ;thus, the elements of E are
2- elements subsets of V.the elements of V are2 the vertices(or nodes, or
points)of the graph G,the elements of E are its edges(or lines).The number of
vertices of a graph G is its order, written as n;its number of edges is denoted
by m.the graph depicted in figure 1.1 has vertex set V={[a,b],[b,c],[c,d],[d,e],
[e,f]}.

a b d
e f
Figure 1.1 the
graph G=(V,E)
c
Let G(V,E)is a graph then have: d
I-LOOP
[1] An edge associated with a vertex pair{v1,v2}.

c b graph(G) has loop on the vertex b.

a Figure 1.2:G
 Basic concepts of graphs

Figure 1.3:G

Graph(G) has not loop

I-multiple edge:[1]
If there are more than one edges associated with a given pair of vertices then these edges
are called parallel edge or multiple edges

Figurel1.4:G
Graph G has multiple edge.
1-2 simple graph
Definition 1.5[1]
Simple graph:
We called the graph(simple graph)if it
has no loops or parallel
elements(multiple edges).
 Basic concepts of graphs

Figurel1.5:G
Graph has no
multiple edge.

Figure Figure Figure

1.7:A 1.6:B 1.8:C

1-3 the adjacent and incident

Definition 1.8[1]
Two vertices x,y of G are adjacent, or neighbours,if xy are an edge of G.Two
edges e≠f is adjacent if they have an end in common.
 Basic concepts of graphs

Definition 1.9[1]
Incident; the vertex(v) is an end-vertex of some edge(e),then(v),and(e), are
said to be incident
u e v

figure1.9:G
w

Vertices u and v are adjacent . Edge e is incident with u and v,e connects u and
v.
Definition 1.11[1]
The number of edges that located on vertex is called Degree of vertex and
written as(v) if(v)=0,the vertex v is called an isolated if(v)=1 v is called end-
vertex

figurel1.10:G
 Basic concepts of graphs

The degree of vertices c and d is 2 and degree of vertex a is 3 and degree of vertex b is1,the
vertex b is called end vertex.
a
figurel1.11:G

b d

c e
the degree of vertices a and d is 2 and the degree of vertex b is 3 and the degree of vertex of
c 1 and the decree of vertex e is 0,the vertex e is called isolated vertex.
1-4 Sub graph
Definition 1.14[1]
Let G and H are two graphs with vertex sets V(G) and V(H) and edge sets E(H),respectively ,
such that V(H ) ⊇v(G) and E(H) ⊇ E(G) ,then we say that it is sub graph of G

Figurel Figurel Figurel Figurel

Figurel
1.12:M 1.14:M2 1.15:M3 1.16:M4
1.13:M1
 Basic concepts of graphs

The M1, M2 and M3 are sub graph of graph M.

Definition 1.16[1]
Let G and H are two sub graphs if V(H)=V(G) and E(H) ⊇ E(G),then we say that H is a
spanning sub graph of G.

Figurel1.19:C
Figurel1.17:A

Figurel1.18:B

The graph B is spanning sub graph of graph A and the graph C is not spanning
sub graph of graph A.
Definition 1.18[1]
Let a nonempty subset U of V(G),a sub graph of G induced by U,denoted by<U>,is
vertices in U.we called<U>an induced-sub graph of G.
Basic concepts of graphs

The graph B is induced sub graph of graph A.