Anyquestions?.

Presentasi berjudul: "Anyquestions?."— Transcript presentasi:

1 anyquestions?

2 jembatanKönigsberg* *recently known as Калинингра́д

3 teoriGRAF

4 G = (V, E) V = { A, B, C, D } E = { e1, e2, e3, e4, e5, e6, e7 }

5 Gambarkan Graf G(V,E) dengan:
Terdiri dari 4 simpul: V = {A, B, C, D} Terdiri dari 6 sisi, yaitu: E = { e1, e2, e3, e4, e5, e6 } e1=(A,C); e2=(A,A); e3=(A,D); e4=(C,D); e5=(B,C); e6=(B,C)

6 Self-Loop A D B C

7 terminologiGraf

8 Bertetangga (Adjecent)

9 Bersisian (Incidency)

10 Simpul Terpencil (Isolated Vertex)

11 Lintasan (Path) = 1 n

12 Lintasan (Path) = 3 n

13 Cut-Set 3 { } adalah cut-set dari (1,2) (1,4) , (1,5) , (2,3) , (2,4)

14 JENIS GRAF Graf tak berarah Graf berarah

15 simple graph

16 multigraph

17 Pseudo graph

18 Directed graph/ digraph

19 Directed multigraph

20 Derajat (Degree) d(v) d(R) = 3 d(Q) = 5

21 din(R) = 1 dout(R) = 1 d(R) = 2 d(v) = din(v) + dout(v)
Derajat (Degree) din(R) = 1 dout(R) = 1 d(R) = 2 d(v) = din(v) + dout(v)

22 GRAF KHUSUS Graf teratur Graf lingkaran Cn

23 IsomorphicGraph

24 HomeomorphicGraphs

25 HomeomorphicGraphs