anyquestions?
jembatanKönigsberg* *recently known as Калинингра́д
teoriGRAF
G = (V, E) V = { A, B, C, D } E = { e1, e2, e3, e4, e5, e6, e7 }
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)
Self-Loop A D B C
terminologiGraf
Bertetangga (Adjecent)
Bersisian (Incidency)
Simpul Terpencil (Isolated Vertex)
Lintasan (Path) = 1 n
Lintasan (Path) = 3 n
Cut-Set 3 { } adalah cut-set dari (1,2) (1,4) , (1,5) , (2,3) , (2,4)
JENIS GRAF Graf tak berarah Graf berarah
simple graph
multigraph
Pseudo graph
Directed graph/ digraph
Directed multigraph
Derajat (Degree) d(v) d(R) = 3 d(Q) = 5
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)
GRAF KHUSUS Graf teratur Graf lingkaran Cn
IsomorphicGraph
HomeomorphicGraphs
HomeomorphicGraphs