VII Dothi PDF

Nhng khi nim v tnh cht c bn
th
Bin son
TS. Nguyn Vit ng
1

e1
e1= v1 v2, e2 =v1v2,

e3 =v1v4, e4 =v2v3,
e5 = v2v3, e6 = v2v4,
e7 = v3v4
e2
V= {v1, v2, v3, v4}

E = {e1, e2, e3, e4, e5, e6, e7}
AB
e4
e5
e6
v2
e4
v3
e3
e2
e5
e7
E ={e1,e2, e3, e4, e5,

e6, e7, e8, e9}
e6
B
e8
v4
V= {O, A, B, AB}
e7
v1
e1
e3
e9
4
nh ngha th
b
a
nh ngha1. th v hng G = (V, E) gm:

i) V l tp hp khc rng m cc phn t ca n gi
l nh(vertex) ca G.
ii) E l a tp hp gm cc cp khng sp th t
ca hai nh. Mi phn t ca E c gi l mt
cnh(edge) ca G. K hiu uv.
5
c
e
h

Ch
Ta ni cnh uv ni u vi v, cnh uv k vi u,v.
Nu uv E th ta ni nh u k nh v.
Hai cnh ni cng mt cp nh gi l hai
cnh song song.
Cnh uu c hai u mt trng nhau gi l mt
khuyn.
7
b
a
nh ngha 2. th v hng khng c cnh

song song v khng c khuyn gi l n
th v hng.
nh ngha 3. th v hng cho php c
cnh song song nhng khng c khuyn gi l
a th v hng.
nh ngha 4. th v hng cho php c
cnh song song v c khuyn gi l gi th
c
e
h
g
b
a
10
Multigraph -A Non-Simple Graph
Nhng khi nimv tnh chtc bn

Simple Graph
Definition . A simple graph G = (V, E) consists of V, a
nonempty set of vertices, and E, a set of unordered pairs
of distinct elements of V called edges.
There can be multiple telephone lines between

two computers in the network.
Detroit
New York
San Francisco
Detroit
Chicago
New York
Denver
Washington
San Francisco
Los Angeles
Chicago
Denver
Washington
In
a multigraph G = (V, E) two or more edges may

connect the same pair of vertices.
Los Angeles
11
12
Pseudograph- A Non-Simple Graph
Multiple Edges
There can be telephone lines in the network from a computer

Detroit
to itself (for diagnostic use).
Detroit
New York
New York
San Francisco
San Francisco
Chicago
Denver
Chicago
Washington
Denver
Los Angeles
Washington
Los Angeles
Two edges are called multiple or parallel edges

if they connect the same two distinct vertices.
In
a pseudograph G = (V, E) two or more edges may

connect the same pair of vertices, and in addition, an
edge may connect a vertex to itself.
13
14
Undirected Graphs
Loops
Detroit
New York
San Francisco
pseudographs
Chicago
multigraphs
Denver
simple graphs
Washington
Los Angeles
An edge is called a loop if it connects a vertex to itself.

16
15

nh ngha 5
a th c hng G =(V,E) gm:
i) V l tp hp khc rng m cc phn t ca n gi

l nh ca G.
ii)E l a tp hp gm cc cp c sp th t ca hai
nh. Mi phn t ca E c gi l mt
cung(cnh)ca G. K hiu uv.
b
a
Ta ni cung uv i t u n v, cung uv k vi u,v

17
18

Ch
Nu uv l mt cung th ta ni:
nh u v v k nhau.
nh u gi l nh u(gc), nh v l nh cui
(ngn) ca cung uv.nh v l nh sau ca nh u.
Hai cung c cng gc v ngn gi l cung song

song.
Cung c im gc v ngn trng nhau gi l
khuyn.
19
20
A Directed Graph
nh ngha 6: a th c hng khng cha
In a directed graph G = (V, E ) the edges are

ordered pairs of (not necessarily distinct) vertices.
Detroit
cc cnh song song gi l th c hng
New York
Chicago
San Francisco
Denver
Washington
Los Angeles
Some telephone lines in the network may operate

in only one direction .
22
21
A Directed Graph
A Directed Multigraph
The telephone lines in the network that operate

in two directions are represented
by pairs of edges in opposite directions.
In a directed multigraph G = (V, E ) the edges are

ordered pairs of (not necessarily distinct) vertices,
and in addition there may be multiple edges.
Detroit
New York
Detroit
New York
Chicago
San Francisco
Chicago
San Francisco
Denver
Denver
Washington
Los Angeles
Los Angeles
23
Washington
There may be several one-way lines in the

same direction from one computer
to another in the network.
24
Types of Graphs
TYPE
EDGES
MULTIPLE EDGES LOOPS

ALLOWED?
ALLOWED?
Simple graph
Undirected
NO
NO
Multigraph
Undirected
YES
NO
Pseudograph
Undirected
YES
YES
Directed graph
Directed
NO
YES
Directed multigraph
Directed
YES
YES
Biu din ma trn ca th:

Ta s dng ma trn k.
Cho G = (V,E) vi V={1,2,,n}.
Ma trn k ca G l ma trn A = (aij)n xc nh nh sau:
aij = s cnh(s cung) i t nh i n nh j
25
26
Tm ma trn k
a
a
b
b
c
0
1
1
0
Tm ma trn k
b
1
0
1
1
1
1
0
1
0
1
1
0
a b c d e
e
f
27
a 0
b 2
c 1
d 0
e 0
f 0
2
0
1
0
1
1
1
1
0
0
0
1
0
0
0
0
0
0
0
1
0
0
1
0
f
0
1
1
0
0
28
Bc nh a: deg(a) = 2
Bc ca nh
Bc nh b: deg(b) = 5
b
Cho th v hng G = (V,E). Bc ca nh

v, k hiu deg(v), l s cnh k vi v , trong
mt khuyn ti mt nh c m hai ln
cho bc ca nh y.
c
d
Bc nh c: deg(c) = 3
Bc nh d: deg(d) = 2
29
30
Cho th c hng G = (V, E), vV
1) deg-(v):= s cung c nh cui l v, gi l bc

vo ca v.
2) deg +(v):= s cung c nh u l v, gi l bc ra
ca v
3) deg(v):= deg- (v) + deg+(v)
nh bc 0 gi l nh c lp. nh bc 1 gi l
nh treo
d
e
f
Bc ca cc nh?
32
31
Bc nh a: deg-(a)= 1 ; deg+(a)=1
Bc nh b: deg-(b)= 1 ; deg+(b)=3
b
e
f
Bc nh c: deg-(c)= 1 ; deg+(c)=2
Bc nh d: deg-(d)= 0 ; deg+(d)=0
Bc nh e: deg-(e)= 1 ; deg+(e)=0
Bc nh f: deg-(f)= 2 ; deg+(f)=0
34
33

nh l
ng cu
Cho th G = (V,E), m l s cnh (cung)

1)
nh ngha
Cho hai n th G = (V,E) v G= (V,E).
Ta ni rng G ng cu G, k hiu G G, nu tn
ti song nh f :V Vsao cho:
uv l cnh ca G f(u)f(v) l cnh ca G
2m deg(v)
vV
2) Nu G c hng th:
m deg(v) deg(v)
vV
vV
3) S nh bc l ca th l s chn
35
36
Graph Isomorphism
Ch
Nu G v G l cc n th v hng ng cu
qua nh x f th chng c:
Cng s nh
Cng s cnh
Cng s nh vi bc cho sn(vd: s nh bc 2
ca G v G bng nhau)
deg v = deg f(v)
37
38
Note. Isomporphic simple graphs must have the same

invariants:
The number of vertices
The number of edges
The degrees of the vertices
No vertex of deg 1
b
b
c
Isomorphism Example
deg(e) = 1
3
6
f
e
Non-isomorphic graphs
d
39
40
10
Non-Isomorphic Example
Are These Isomorphic?
4
5
d
c
* Same # of
vertices
* Same # of
edges
* Different
# of verts of
degree 2!
(1 vs 3)
41

th con
42
NHNG KHI NIM V TNH CHT C BN
Subgraphs
Cho hai th G = (V,E) v G = (V,E)

(cng v hng hoc cng c hng).
G c gi l th con ca G, k hiu G G
nu V V v E E
Nu V= V v E E th G c gi l th
con khung ca G.
43
44
11
ng i, chu trnh, th lin thng
ng i, chu trnh, th lin thng:
Cho G = (V,E) l th v hng u,vV
b) ng i khng c cnh no xut hin qu
a) ng i ( dy chuyn) c chiu di k ni hai
mt ln gi l ng
i n
c) ng i khng c nh no xut hin qu
mt ln gi l ng i s cp
nh u,v l dy nh v cnh lin tip nhau

v0e1v1e2vk-1ekvk sao cho:
d) ng i c gi l chu trnh nu n bt u
v kt thc ti cng mt nh
v 0=u ,v k = v, e i=v i-1v i , i=1,2,,k

45
46

Chu trnh s
cp no khng?
(a, e1,b,e2,c,e3,d,e4,b )l ng i t nh a ti nh b c
chiu di l 4. Tuy nhin, trong trng hp ny, th ca
chng ta l n th, do vy c th gi ng i ny bng 1
cch ngn gn nh sau: (a,b,c,d,b)
Chu trnh s cp:
(b,c,d,b)
(b,f,e,b)
nh ngha. Cho G = (V,E). Trn V ta nh ngha

quan h tng ng nh sau:
u~v u = v hay c mt ng i t u n v
a) Nu u~v th ta ni hai nh u v v lin thng vi
nhau
b) Mi lp tng ng c gi l mt thnh
phn lin thng ca G
c) Nu G ch c mt thnh phn lin thng th G
gi l lin thng
48
47
12

nh ngha. Cho G = (V,E) l th v hng
lin thng
a) nh v c gi l nh khp nu G v khng
lin thng (G v l th con ca G c c
bng cch xo v v cc cnh k vi v)
b) Cnh e c gi l cu nu G- e khng lin
thng( G-e l th con ca G c c bng
cch xo cnh e).
50
49

nh ngha. Cho G = (V,E) v hng lin thng,
khng phi Kn, n>2.
a) S lin thng cnh ca G, k hiu e(G) l s
cnh t nht m khi xo i G khng cn lin
thng na.
b) S lin thng nh ca G, k hiu v(G) l s
nh t nht m khi xo i G khng cn lin
thng na.
52
51
13
nh ngha. Cho G =(V,E) l th c hng u,vV

a) ng i ( dy chuyn) c chiu di k ni hai
nh u,v l dy nh v cung lin tip nhau
v0e1v1e2.vk-1ek vksao cho:
v0 = u, vk = v
ei = vi-1vi , i = 1,2,,,k.
54
53
b) ng i khng c cung no xut hin qu

mt ln gi l ng
i n.
c) ng i khng c nh no xut hin qu
mt ln gi l ng i s cp.
ng i c di 4 t nh 1 ti nh
2 l : (1,2,3,4,2)
d) ng i c gi l mch(chu trnh) nu n
bt u v kt thc ti cng mt nh.
55
56
14

nh ngha. Cho th c hng G = (V,E). Trn V ta
nh ngha quan h tng ng nh sau:

u~v u = v hay c mt ng i t u n v v ng
i t v n u .
a) Nu u~v th ta ni hai nh u v v lin thng mnh vi
nhau .
b) Mi lp tng ng c gi l mt thnh phn lin
thng mnh ca G .
c) Nu G ch c mt thnh phn lin thng mnh th G gi
l lin thng mnh .
57
58
Mt s th v hng c bit
1. th cp n: Kn l n th cp n m gia hai
nh bt k u c mt cnh.
2. th k-u : l th m mi nh u c bc
bng nhau v bng k.
3. th lng phn:
G = (V,E), V = V1 V2, , V1 V2 =.
Mi cnh ca G u ni mt nh trong V1 vi mt nh
trong V2
59
Mt s th c bit
4. th lng phn : l th n, lng
phn, mi nh trong V1 u k vi mi nh trong V2.
5. th b
Cho Kn = (V,E), G (V,E1) Kn ,
G V , E \ E1
G gi l th b ca G. th G c gi l
t b nu G ng cu vi th b ca n
60
15
Mt s th c bit
Mt s th c bit
C4
K4
C5
K5
Cycle Cn
Complete graph Kn
61
62
Mt s th c bit
K1 K
2
K4
K3
n
W4
Note that Kn has i
W5
i 1
K5
K6
n(n 1)
edges.
2
Wheele Wn
63
64
16
C3
C4
C5
C6
C7
W3
C8
W4
W5
W6
W7
W8
How many edges are there in Wn?
How many edges are there in Cn?
65
Q0
Q1 Q2
Number of vertices:
66
Q4
Q3
Number of edges:Exercise to try!
2n.
67
68
17
thi
thi
1)2000. HBK
Cho th v hng , n G c 7 nh trong
c mt nh bc 6. Hi G c lin thng khng?
Gii. nh bc 6 ni vi 6 nh cn li. Do
hai nh bt k u c mt ng i qua nh bc
6
2)2001,HBK
Cho th v hng G lin thng m mi
nh u c bc bng 20. Chng minh rng
nu xo i mt cnh bt k th th thu
c vn cn lin thng
69
70
thi
thi
3)2002,HKHTN.
Gii .
Gi s ta xa cnh uv. Ta ch cn chng minh
vn c ng i t u n v.
Phn chng. Gi s khng c ng i t u
n v. Khi thnh phn lin thng G cha u
m khng cha v. Trong G, u c bc 19, mi
nh khc u c bc 20. Tng cc bc trong
G l s l .V l.
th G gm n nh, 41 cnh, mi nh u c
bc p. Nu p l v p> 1 th th G c lin thng
khng?
71
72
18
thi
thi
Gii . T cng thc bc ca nh ta c np=2.41.

V p l nn p l c ca 41. M 41 l s nguyn t nn p = 41.
Vy n = 2
Do G c 2 nh m c 2 nh u c bc 41. Nu G khng
lin thng th G phi tch thnh 2 thnh phn lin thng, m
mi thnh phn lin thng u c bc 41 (l). V l.
4)2005, HKHTN.
V n th v hng gm 6 nh vi bc
2,2,3,3,3,5
73
thi
74
thi
Gii .
Nhn xt . nh bc 5 ni vi 5 nh cn li.
Do ta ch phi quan tm n 5 nh cn li.
Ta xt n th vi 5 nh v cc bc l
1,1,2,2,2.
TH1. Hai nh bc 1 ni vi nhau, 3 nh bc 2
ni vi nhau to thnh chu trnh
75
76
19
thi
thi
TH2. Hai nh bc 1 khng ni vi nhau. Khi
hai nh bc 1 phi ni vi hai nh bc 2
khc nhau v nh bc hai cn li phi ni vi
hai nh bc hai y
Suy ra th cn tm l
77
thi
78
thi
Suy ra th cn tm l:
5)2006 , HKHTN.
V th n v hng gm 6 nh vi bc
2,2,3,3,3,3
79
80
20
thi
thi
Gii.
TH1. 2 nh bc 2 ni vi nhau. Nu chng ni n
cng mt nh bc 3 th nh bc 3 ny ch ni n
mt trong 3 nh cn li:khng th uc. Nh vy
hai nh bc hai ni n hai nh bc 3 khc nhau.
B 2 nh bc hai ta s c mt n th v
hng gm 4 nh vi bc 2, 2, 3, 3. rng
trong th ny mi nh bc 2 u ni vi 2 nh
bc 3 v do 2 nh bc 3 cng ni vi nhau.
Ta c
81
82
thi
thi
TH2. 2 nh bc 2 khng ni vi nhau nhng

ni n cng mt nh bc 3. Khi y nu b i
hai cnh ny ta c mt th 6 nh vi bc
1, 1, 1, 3, 3, 3. Nu 2 nh bc 1 ni vi nhau
hoc ni n cng mt nh bc 3 th b i 2
nh ny cn li mt th nh vi bc 1, 3,
3, 3 hoc 1, 1, 3, 3: khng th c. Nh vy
mi nh bc 1 ni n nh bc 3 khc nhau.
B i nh bc 1 s cn li mt chu trnh 2, 2,
2
83
v ta c th
84
21
thi
thi
TH3. 2 nh bc 2 khng ni vi nhau

v mi nh ni n 2 nh bc 3 khc
nhau. Khi y nu b i hai nh ny s
cn li mt chu trnh 2, 2, 2, 2 v ta c:
6) thi 07
Tm tt c cc n th v hng (sai
khc mt ng cu) gm 6 nh vi bc :
2, 2, 2, 3, 3, 4
85
thi
86
thi
Gii 2,5 (ve moi o th c 0,5. Ly luan ay u

ay la 4 li giai duy nhat: 0,5)
Trng hp 1: nh bac 4 noi en 2 nh bac 3 va 2
nh bac 2. Bo nh bac 4 va 4 canh tng ng ta se
c 1 o th n vo hng gom 5 nh vi bac 1,
1, 2, 2, 2.
Trng hp 1a: moi nh bac 1 eu noi vi 1 nh
bac 2 (phai khac nhau). Do o nh bac 2 con lai se
noi en 2 nh bac 2 tren. Chung tao thanh mot day
chuyen 1,2,2,2,1. Ta c 2 o th khong ang cau
nhau
87
88
22
thi
thi
Trng hp 2: nh bac 4 noi en 3 nh bac

2 va 1 nh bac 3. Khi ay neu bo i nh bac
4 va cac canh tng ng ta se c 1 o th
n vo hng gom 5 nh vi bac
1, 1, 1,
2, 3. Khi ay nh bac 3 ch co the noi en 2
nh bac 1 va nh bac 2. nh bac 1 con lai
se noi en nh bac 2, va ta c
89
90
thi
thi
Trng hp 1b: 2 nh bac 1 noi nhau. Nh

vay 3 nh bac 2 tao thnh mot day chuyen.
Ta c o th
HKHTN08 .Cho th G n, v hng ,10

nh v c nhiu hn 36 cnh.Hi G c lin
thng khng ?Ti sao?
Gii(tm tt). G l th lin thng
Phn chng.
Gi s G khng lin thng .Gi G1 l mt thnh
phn lin thng gm k nh 1 k 9.Gi m l s
cnh ca G th m k2 -10k +45 .
M max (k2 -10k +45) =36 (vi 1 k 9) nn
m 36.Tri gi thit.
92
91
23
thi
thi
HKHTN 2009.
Xt th n v hng G vi 6 nh , trong c mt nh bc
1 v 5 nh bc 3. Chng minh rng G lin thng.
Gii.
Gi s G khng lin thng. Gi G1, G2, ,Gk l cc thnh phn
lin thng ca G (k 2). V G khng c nh c lp nn mi
thnh phn lin thng u phi c t nht hai nh. Nh vy mi
thnh phn lin thng u phi c t nht mt nh bc 3. Suy ra
mi thnh phn lin thng phi c t nht 4 nh. Vy G phi c t
nht 4k 8 nh . Tri gi thit.
Cch khc.
Nu b i nh bc 1 v cnh k n ta s c n th v
hng H gm 5 nh vi bc l 2, 3, 3, 3, 3. R rng nu H lin
thng th G cng lin thng.
Trong th H nh bc 2 phi ni vi 2 nh bc 3 khc nhau.
B nh bc 2 ny v b hai cnh k vi n ta c th K gm
4 nh vi bc 2, 2, 3, 3. R rng nu K lin thng th H cng lin
thng v do G cng lin thng.
Trong th K hai nh bc 3 phi ni vi nhau. B cnh ni hai
nh bc 3 ny ta c th gm 4 nh bc 2, th ny l mt
chu trnh , n lin thng . Do G lin thng.
93
94
Bi ton ng i ngn nht
Bi ton ng i ngn nht
th c trng s
Ma trn khong cch(trng s)
1. th G = (V,E) gi l th c trng s (hay chiu

di, trng lng) nu mi cnh(cung) e c gn vi
mt s thc w(e).Ta gi w(e) l trng lng ca e.
2. di ca ng i t u n v bng tng di cc
cnh m ng i qua
3. Khong cch gia 2 nh u,v l di ngn nht ca
cc ng i t u n v.
95
Cho G = (V, E), V = {v1,v2,,vn} l n th c trng

s. Ma trn khong cch ca G l ma trn D= (dij) xc
nh nh sau:
0
khi i j
d ij w(v i v j ) khi vi v j E
khi vi v j E
96
24
5
0
26
70
31
27
0
40
8
0
73
49
0
23
10
25
16
38
12
0
Bi ton ng i ngn nht

Thut ton Dijkstra
Bi ton.
Cho G = (V, E) n, lin thng, c trng s dng
(w(uv) > 0 vi mi u khc v). Tm ng i ngn
nht t u0 n v v tnh khong cch d(u 0,v).
98
97
Bi ton ng i ngn nht
Bi ton ng i ngn nht
Phng php
Xc nh tun t cc nh c khong cch n u0
t nh n ln.
1. Trc tin nh c khong cch nh nht n u0
l u0.
2. Trong V\{u0} tm nh c khong cch n u0
nh nht (nh ny phi l mt trong cc nh k
vi u0) gi s l u1
99
3. Trong V\{u0,u1} tm nh c khong cch n

u0 nh nht(nh ny phi l mt trong cc
nh k vi u0 hoc u1 )gi s l u2
4. Tip tc nh trn cho n bao gi tm c
khong cch t u0 n mi nh .
Nu G c n nh th:
0 = d(u0,u0) < d(u0,u1) d(u0,u2) d(u0,un-1)
100
25
Thut ton Dijkstra

Bc1. i:=0, S:=V\{u0}, L(u0):=0, L(v):=vi mi v S v
nh du nh v bi(,-). Nu n=1 th xut d(u0,u0)=0=L(u0)
Bc2. Vi mi v S v k vi ui(nu th c hng th v
l nh sau ca ui), t L(v):= min{L(v),L(ui)+w(ui v)}.Xc
nh k = minL(v) ,vS.
Nu k= L(vj) th xut d(u0,vj )= k v nh du vj bi (L(vj);ui).
ui+1:= vj S:=S\{ui+1}
Bc3 i:=i+1
Nu i = n-1 th kt thc
Nu khng th quay li Bc 2
Bi ton ng i ngn nht

Bi tp 1. Tm ng i ngn nht t u0 n cc
nh cn li
s
u
2
1
y
x
1
4
z
101
r
4
1
3
r
s
t
x
y
z
w
(,-) (,-) (,-) (,-) (,-) (,-) (,-)
103
u0
0*
-
4
y
1
w
3
1
7
3
x
1
u0
0*
7
3
102
w
5
r
s
t
x
y
z
w
(,-) (,-) (,-) (,-) (,-) (,-) (,-)
(4,u0) (,-) (,-) (,-) (1u0)* (,-) (,-)
104
26
x
1
4
y
r
s
(,-) (,-)
(4,u0) (,-)
(3,y)* (,-)
t
(,-)
(,-)
(,-)
x
(,-)
(,-)
(,-)
y
z
(,-) (,-)
(1u0)* (,-)
(4,y)
w
(,-)
(,-)
(,-)
105
Bi ton ng i ngn nht

Cy ng i
1
1
2
1
y
u0
0*
-
r
s
(,-) (,-)
(4,u0) (,-)
(3,y)* (,-)
(10,r)
(10,r)
(9,t)
(8,x)*
-
4
z
t
(,-)
(,-)
(,-)
(6,r)
(6,r)*
-
x
(,-)
(,-)
(,-)
(,-)
(,-)
y
z
(,-) (,-)
(1u0)* (,-)
(4,y)
(4,y)*
(7,t)* -
w
(,-)
(,-)
(,-)
(,-)
(9,z)
(9,z)
(9,z)
106
(9,z)*
Bi tp 2(HKHTN,2006).
Cu 5. Cho th c trng s G = (V, E) ,
V = { v1, v2, v3, v4, v5, v6 , v7}xc nh bi ma
trn trng s D. Dng thut ton Dijkstra tm
ng i ngn nht t v1 n cc nh v2,v3,v 4, v5,
v6,v7
s
t
t
3
Bi ton ng i ngn nht
r
3
1
3
u0
0*
-
r
4
107
108
27
Bi ton ng i ngn nht
Bi ton ng i ngn nht
0 5 31 40
0 27 73
26 0 8 49 25 38
D 0 16
70 0 9
23 0 12
10 0
109
Bi ton ng i ngn nht

v1
0*
-
v2
(,-)
v3
v4
v5
Bi ton ng i ngn nht
v6
v7
(,-)
(,-)
(,-)
(,-)
(31,v 1)*
(40,v1) (78,v2) (,-)
(,-)
(78,v2) (56,v3) (69,v3)
(,-) (,-) (,-)

(5,v1)* (31,v1) (40,v1) (,-)
110
(39,v3)*
(78,v2) (55,v4)* (69,v3)
(78,v2) -
(67,v 6)*
(77,v7) -
111
112
28
Bi ton ng i ngn nht
Bi ton ng i ngn nht
b
c
a
0
(
)
(
*
(5, a ) (4, a )
(5,
a
)
Bi tp3(HKHTN2005).
Cho mt v d chng t rng thut ton
Dijkstra tm ng i ngn nht t mt nh
n cc nh khc khng p dng c cho
th c trng lng nu c cnh c trng lng
m
5
a
113
Bi ton ng i ngn nht
-3
c
114
(,-)
(,-)
(,-)
(,-)
(,-)
(,-)
(,-)
BAI 4(2007)
Dung thuat toan Dijsktra e tm ng i ngan
nhat t nh a en nh z va chieu dai cua no
trong o th vo hng co trong lng sau:
(4.a)
(3.a)
(,-)
(,-)
(,-)
(,-)
(,-)
(4.a)
(3.a)
(6.c)
(9.c)
(,-)
(,-)
(,-)
(4.a)
(3.a)
(6.c)
(9.c)
(,-)
(,-)
(,-)
(4.a)
(3.a)
(6.c)
(7.d)
(11.d)
(,-)
(,-)
(4.a)
(3.a)
(6.c)
(7.d)
(11.d) (12,e )
(4.a)
(3.a)
(6.c)
(7.d)
(11.d) (12,e ) (18,f )
(4.a)
(3.a)
(6.c)
(7.d)
(11.d) (12,e ) (16,g )
(4.a)
(3.a)
(6.c)
(7.d)
(11.d) (12,e ) (16,g )
7
2
a
3
4
c
(,-)
g
115
116
29
Bi ton ng i ngn nht
Bi ton ng i ngn nht
Thut ton Ford Bellman

Tm ng i ngn nht t u0 n cc nh hoc ch ra th
c mch m.
Bc 1. L0(u0) =0 v L0(v) = vu0. nh du nh v
bng ( ,-) ; k=1.
Bc 2. Lk(u0) = 0 v
Lk(v) = min{Lk-1(u)+w(uv)/u l nh trc ca v}
Nu Lk(v) = Lk-1(y)+w(yv)th nh du nh v bi (Lk(v),y)
Bc 3. Nu Lk(v) =Lk-1(v) vi mi v, tc Lk(v)

n nh th dng. Ngc li n bc 4.
Bc 4. Nu k = n th dng. G c mch m. Nu
k n-1 th tr v bc 2 vi k:=k+1
117
118
Bi ton ng i ngn nht
Bi ton ng i ngn nht
BT1.
1
7
1
2
2
4
1
119
2
6
-6
-6
5
8
4
(,-)
(,-)
(,-)
(,-)
(,-)
120
30
7
1
2
6
-6
3
4
1
-6
(,-)
(,-)
(,-)
(,-)
(,-)
(7,1)
(,-)
(8,1)
(,-)
(,-)
2
6
(,-)
(,-)
(,-)
(,-)
(,-)
(7,1)
(,-)
(8,1)
(,-)
(,-)
(7,1)
(11,2) (8,1)
(9,2)
(8,2)
121
7
1
4
1
2
1
-6
5
7
6
122
-6
(,-)
(,-)
(,-)
(,-)
(,-)
(,-)
(,-)
(,-)
(,-)
(,-)
(7,1)
(,-)
(8,1)
(,-)
(,-)
(7,1)
(,-)
(8,1)
(,-)
(,-)
(7,1)
(11,2) (8,1)
(9,2)
(8,2)
(7,1)
(11,2) (8,1)
(9,2)
(8,2)
(7,1)
(10,6) (2,6)
(9,2)
(8,2)
(7,1)
(10,6) (2,6)
(9,2)
(8,2)
(4,4)
(10,6) (2,6)
(4,4)
(8,2)
123
124
31
2
2
8
k
4
2
-6
5
2
3
2
2
4
(,-)
(7,1)
4
2
2
3
3
5
2
-6
(,-)
(,-)
(,-)
(,-)
(,-)
(8,1)
(,-)
(,-)
(,-)
(,-)
(,-)
(,-)
(,-)
(7,1)
(,-)
(8,1)
(,-)
(,-)
(7,1)
(11,2) (8,1)
(9,2)
(8,2)
(7,1)
(11,2) (8,1)
(9,2)
(8,2)
(7,1)
(10,6) (2,6)
(9,2)
(8,2)
(4,4)
(10,6) (2,6)
(4,4)
(8,2)
(7,1)
(10,6) (2,6)
(9,2)
(8,2)
(4,4)
(10,6) (2,6)
(4,4)
(8,2)
(4,4)
(8,2)
(2,6)
(4,4)
(5,2)
(4,4)
(8,2)
(4,4)
(5,2)
(4,4)
(7,6)
(-1,6) (4,4)
(5,2)
(2,6)
125
126
Bi ton ng i ngn nht
Bi ton ng i ngn nht
k = n = 6 . Lk(i) cha n nh nn th c mch

m. Chng hn:
4264 c di -3
k = n = 6 . Lk(i) cha n nh nn th c mch

m. Chng hn:
4264 c di -3
127
128
32
Bi ton ng i ngn nht
Bi ton ng i ngn nht
BT2.
7
1
2
2
4
1
2
6
-2
8
4
5
2
k 1
0 0
(,-)
(,-)
(,-)
(,-)
(,-)
1 0
(7,1)
(,-)
(8,1)
(,-)
(,-)
2 0
(7,1)
(11,2) (8,1)
(9,2)
(8,2)
3 0
(7,1)
(10,6) (6,6)
(9,2)
(8,2)
4 0
(7,1)
(10,6) (6,6)
(8,4)
(8,2)
5 0
(7,1)
(10,6) (6,6)
(8,4)
(8,2)
129
Bi ton ng i ngn nht
Bi ton ng i ngn nht

Thut ton Floyd.
Tm ng i ngn nht gia tt c cc cp nh
hoc ch ra th c mch m. Ngoi ma trn
khong cch D ta cn dng ma trn Q = (Q ij),
trong
2
6
-2
4
130
j khi ij E
Qij
0 khi ij E
5
2
131
132
33
Bi ton ng i ngn nht
Bi ton ng i ngn nht
Bc 1. D0 = D, Q0 = Q, k = 1.
Bc 2. Vi i = 1 n n, vi j =1 n n. t
Dk 1 (i, k ) Dk 1 (k , j )
Dk (i, j )
Dk 1 (i, j )
Qk 1 (i, k )
Qk (i, j )
Qk 1 (i, j )
Bc 3. Nu k = n th dng. Nu k < n th tr
li Bc 2 vi k := k + 1
if Dk 1 (i, j) Dk 1 (i, k ) Dk 1 (k , j )
if Dk 1 (i, j) Dk 1 (i, k ) Dk 1 (k , j )
if Dk 1 (i, j) Dk 1 (i, k ) Dk 1 (k , j )
if Dk 1 (i, j) Dk 1 (i, k ) Dk 1 (k , j)
133
Bi ton ng i ngn nht
134
Bi ton ng i ngn nht
Cho th G c ma trn khong cch l
Khi ma trn Q s l
11
22
33
44
1
1
0
0
4
4
1
1
1
1
0
0
4
2
1
3
2
2
0
0
5
5
3
3
2
2
0
0
5
4
3
5
3
3
2
2
0
0
10
10
3
3
2
2
0
0
10
4
4
4
0
0
9
9
44
00
9
6
5
5
4
4
0
0
7
7
55
44
00
7
6
6
6
6
6
9
0
66
62
9
0
135
136
34
Bi ton ng i ngn nht
Bi ton ng i ngn nht
Ta c D1 = D, Q1 = Q v
D2 =
1
1
0
0
4
4
1
1
1
1
0
0
4
2
1
3
2
2
0
0
5
5
3
3
2
2
0
0
5
4
3
5
3
3
2
2
0
0
10
7
3
3
2
2
0
0
10
2
4
4
0
0
9
9
4
4
0
0
9
6
5
5
4
4
0
0
7
7
5
5
4
4
0
0
7
6
6
6
6
6
11
9
0
6
6
6
2
9
0
Q2 =
137
Bi ton ng i ngn nht
D3 =
138
Bi ton ng i ngn nht
1
1
0
0
4
3
1
1
1
1
0
0
4
3
1
3
2
2
0
0
5
5
3
3
2
2
0
0
5
4
3
5
3
3
2
2
0
0
10
7
3
3
2
2
0
0
10
2
4
4
0
0
9
9
4
4
0
0
9
6
5
5
4
4
0
0
7
7
5
5
4
4
0
0
7
6
6
6
6
6
11
9
0
6
6
6
2
9
0
Q3 =
139
140
35
Bi ton ng i ngn nht
D4 =
Bi ton ng i ngn nht
1
1
0
0
4
3
1
1
17
1
1
0
0
4
3
1
3
2
2
0
0
5
5
3
3
14
2
2
0
0
5
4
3
5
3
3
2
2
0
0
10
7
16
3
3
2
2
0
0
10
2
4
4
0
0
9
9
4
4
0
0
9
6
5
5
4
4
0
0
7
7
5
5
4
4
0
0
7
6
6
6
6
6
11
9
0
6
6
6
2
9
0
Q4 =
141
Bi ton ng i ngn nht
D5 =
142
Bi ton ng i ngn nht
1
1
0
0
4
3
1
1
13
1
1
0
0
4
3
1
3
2
2
0
0
5
5
3
3
10
2
2
0
0
5
4
3
5
3
3
2
2
0
0
10
7
12
3
3
2
2
0
0
10
2
4
4
15
0
0
9
9
4
4
0
0
9
6
5
5
13
4
4
0
0
7
7
5
5
4
4
0
0
7
6
6
6
6
6
11
9
0
6
6
6
2
9
0
Q5 =
143
144
36
Bi ton ng i ngn nht
D6 =
Bi ton ng i ngn nht
1
1
0
0
4
3
1
1
13
1
1
0
0
4
3
1
3
2
2
0
0
5
5
3
3
10
2
2
0
0
5
4
3
5
3
3
2
2
0
0
10
7
12
3
3
2
2
0
0
10
2
4
4
15
0
0
18
9
9
4
4
0
0
9
6
5
5
13
4
4
0
0
7
7
5
5
4
4
0
0
7
6
6
6
6
6
11
9
0
6
6
6
2
9
0
Q6 =
145
Bi ton ng i ngn nht
146
ng i Euler - ng i Hamilton
ng i ngn nht t nh 1 n nh 6 l
1 3 2 5 6 v
Q6(1,6) =3,Q6(3,6) = 2,Q6(2,6) = 5,Q6(5, 6) = 6.
ng i ngn nht t nh 4 n nh 5 l
4 6 2 5 v
Q6(4,5) =6,Q6(6,5) = 2,Q6(2,5) = 5.
147
Euler
(1707-1783)
148
37
ng i Euler - ng i
Hamilton
Problem. The town of Knigsberg was divided into
four sections by the branch of the Pregel River
Hamilton
(1755-1804)
These four sections are connected by seven bridges

149
150
Euler Paths
Question. Can one cross seven bridges and return to

the starting point without crossing any bridge twice?
151
In the eighteenth century, Euler solved this problem

using Graph Theory
152
38
A
ng i Euler
nh ngha.
B
Euler modeled this problem using the multigraph:

four sections correspond to
four vertices A, B, C, D.
each bridge corresponds
to an edge
ng i Euler l ng i qua tt c cc
cnh mi cnh (cung) ng mt ln.Chu
trnh Euler l chu trnh i qua tt c cc cnh
ca th mi cnh ng mt ln.
ii. th c gi l th Euler nu n c chu
trnh Euler
i.
D
153
154
iu kin cn v .
i. Cho G = (V,E) l th v hng lin thng.
G l th Euler Mi nh ca G u c
bc chn.
Nu G c hai nh bc l cn mi nh khc u
c bc chn th G c ng i Euler
ii. Cho G l th c hng lin thng. G l
th Euler G cn bng.
155
ng i Euler-ng i Hamilton
Thut ton Fleury tm chu trnh Euler.
1. Bt u t mt nh bt k ca G v tun theo
qui tc sau: Mi khi i qua mt cnh no th
xo n i, sau xo nh c lp nu c.
2. Khng bao gi i qua mt cu tr phi khng
cn cch i no khc.
156
39
b
ng i Hamilton.
nh ngha. ng i Hamilton l ng i qua tt

c cc nh ca th mi nh ng mt ln.
nh ngha tng t cho chu trnh Hamilton
(mch Hamilton).
thi gi l th Hamilton nu n c chu
trnh Hamilton
abcfdcefghbga
157
158
Qui tc xy dng mt chu trnh Hamilton
H hoc ch ra th v hng khng l Hamilton
iu kin (cho th n v hng).
i. nh l Ore(1960). Cho th G c n nh.

Nu deg(i)+deg(j) n 3 vi i v j l hai nh
khng k nhau tu th G l Hamilton.
ii. nh l Dirac (1952) Cho th G c n
nh. Nu deg(i) n/2 vi i tu th G l
Hamilton
159
Qui tc 1.Tt c cc cnh k vi nh bc 2 phi

trong H
Qui tc 2. Khng c chu trnh con(chu trnh c chiu
di <n) no c to thnh trong qu trnh xy dng H
160
40
Qui tc 3. Khi chu trnh Hamilton m ta ang xy
dng i qua nh i th xo tt c cc cnh k vi i
m ta cha dng(v khng c dng n na).
iu ny li c th cho ta mt s nh bc 2 v ta
li dng qui tc1.
Qui tc 4. Khng c nh c lp hay cnh treo no
c to nn sau khi p dng qui tc 3.
iu kin cho th c hng , n(khng
c khuyn v khng c cnh song song cng
chiu)
K Meyniel. ij v ji E deg(i)+deg(j)2n-1 vi i, j ty .
LMeyniel(1973). Nu G l th n, lin thng mnh
v tho K Meyniel th G l th Hamilton.
L Camion(1959). Nu G l n th , lin thng mnh
th G Hamilton
161
162
thi2004(HKHTN)
thi sau y c Hamilton khng?
LGhouila-Houri(1960) Nu G l n th
lin thng mnh sao cho mi nh u c bc
khng nh hn n th G Hamilton.
L Woodall(1972). Cho G l n th tho
ij E deg+(i)+deg-(j)n, vi mi i,j
th G Hamilton
1
4
7
163
3
6
164
41
Gi s G c chu trnh Hamilton H, theo qui

tc1,tt c cc cnh k vi nh bc 2 u
trong H:12,14,23,36,47,78,69,89. Ta c chu
trnh con l 1,2,3,6,9,8,7,4,1.
Vy G khng l th Hamilton.
thi 2005(HKHTN).Cho G l th khng
hng, n, n 3(n l s nh),
deg(i)+deg(j)n-1. Chng minh rng G c
ng i Hamilton.
Gii:
Ta thm vo th G mt nh z v ni z vi mi nh
ca G bi mt cnh, ta thu c th G c n+1
nh.Bc ca mi nh trong G u ln hn bc c
ca n mt n v(trz), cn bc ca z bng n.
Do trong Gth
deg(i)+deg(j)=deg(i)+1+deg(j) +1 n-1+1+1 = n+1,
khi i v j khc z .
deg (i) + deg (z) = deg (i) + 1 + n n+1 ,vi i khc z
Theo L Ore th G l th Hamilton,suy ra G c
ng i Hamilton
165
166
42

VII Dothi PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

VII Dothi PDF

Uploaded by

Copyright:

Available Formats

Nhng khi nim v tnh cht c bn

Nhng khi nim v tnh cht c bn

Nhng khi nim v tnh cht c bn

e1= v1 v2, e2 =v1v2,

V= {v1, v2, v3, v4}

E ={e1,e2, e3, e4, e5,

Nhng khi nim v tnh cht c bn

nh ngha1. th v hng G = (V, E) gm:

Nhng khi nim v tnh cht c bn

Nhng khi nim v tnh cht c bn

nh ngha 2. th v hng khng c cnh

Multigraph -A Non-Simple Graph

Nhng khi nimv tnh chtc bn

There can be multiple telephone lines between

a multigraph G = (V, E) two or more edges may

Pseudograph- A Non-Simple Graph

There can be telephone lines in the network from a computer

Two edges are called multiple or parallel edges

a pseudograph G = (V, E) two or more edges may

An edge is called a loop if it connects a vertex to itself.

Nhng khi nim v tnh cht c bn

a th c hng G =(V,E) gm:

i) V l tp hp khc rng m cc phn t ca n gi

Ta ni cung uv i t u n v, cung uv k vi u,v

Nhng khi nim v tnh cht c bn

Hai cung c cng gc v ngn gi l cung song

nh ngha 6: a th c hng khng cha

In a directed graph G = (V, E ) the edges are

cc cnh song song gi l th c hng

Some telephone lines in the network may operate

The telephone lines in the network that operate

In a directed multigraph G = (V, E ) the edges are

There may be several one-way lines in the

Nhng khi nim v tnh cht c bn

MULTIPLE EDGES LOOPS

Biu din ma trn ca th:

Nhng khi nim v tnh cht c bn

Cho th v hng G = (V,E). Bc ca nh

Nhng khi nim v tnh cht c bn

Cho th c hng G = (V, E), vV

1) deg-(v):= s cung c nh cui l v, gi l bc

Nhng khi nim v tnh cht c bn

Cho th G = (V,E), m l s cnh (cung)

Nhng khi nim v tnh cht c bn

Nhng khi nim v tnh cht c bn

Note. Isomporphic simple graphs must have the same

Are These Isomorphic?

Nhng khi nim v tnh cht c bn

NHNG KHI NIM V TNH CHT C BN

Cho hai th G = (V,E) v G = (V,E)

ng i, chu trnh, th lin thng

ng i, chu trnh, th lin thng:

Cho G = (V,E) l th v hng u,vV

b) ng i khng c cnh no xut hin qu

a) ng i ( dy chuyn) c chiu di k ni hai

nh u,v l dy nh v cnh lin tip nhau

v 0=u ,v k = v, e i=v i-1v i , i=1,2,,k

ng i, chu trnh, th lin thng

nh ngha. Cho G = (V,E). Trn V ta nh ngha

ng i, chu trnh, th lin thng

ng i, chu trnh, th lin thng

ng i, chu trnh, th lin thng

nh ngha. Cho G =(V,E) l th c hng u,vV