Bina Nusantara 2

Learning Outcomes

• Mahasiswa dapat menghubungkan teori label & directed graph ke berbagai bidang aplikasi teknik matematika dan bisnis.

Bina Nusantara 3

Outline Materi:

• Aplikasi Isomorphisma graph• Aplikasi Labeled graph• Aplikasi Directed grapah• Aplikasi graph pada berbagai bidang..

Bina Nusantara 4

Contoh Terapan Graph

• Rangkaian listrik.

AB

C

DEF

AB

C

E DF

Bina Nusantara 5

Contoh Terapan Graph

• Isomer senyawa kimia karbon

metana (CH4) etana (C2H6) propana (C3H8)

C

H

H

HH

Bina Nusantara 6

Contoh Terapan Graph

Transaksi konkuren pada basis data terpusatTransaksi T0 menunggu transaksi T1 dan T2

Transaksi T2 menunggu transaksi T1

Transaksi T1 menunggu transaksi T3

Transaksi T3 menunggu transaksi T2 T1

T0

T3

T2

Bina Nusantara 7

A spanning tree of a graph G is a subgraph of G that is a tree containing all thevertices of G.

In a weighted graph, a minimum spanning tree is a spanning tree whose sum of edge weights is as small as possible. It is the most economical tree of a graph with weighted edges.

13

1

34

11

52

21 2

4

213

1

34

11

52

21 2

4

2

Bina Nusantara 8

Minimal Spanning TreesOne can turn an island cluster into a complete graph with paths from each island to all of its neighbors. The distance between these islands can be measured very easily and applied as weights to the edges of the graph. From this we can construct an adjacency matrix, and from this matrix we can find with a minimum spanning tree that hits all the islands.

1 2

2 2

3

4

4

5

3

3

2

1

A

B

C

D

E

F

G10

63

76

12

6

9

10

Bina Nusantara 9

• Prim’s algorithm states: Setting n= to the number of vertices, repeat the following step until the tree T has n-1 edges: Add to T the shortest edge between a vertex in T and a vertex not in T (initially pick any edge of the shortest length).

A B C D E F GA * 3 1 4 6 9 10 B 3 * 2 6 4 10 12C 1 2 * 2 2 5 7D 4 6 2 * 3 3 3E 6 4 2 3 * 2 6F 9 10 5 3 2 * 1G 10 12 7 3 6 1 *

Here n = 7; T will have 6 edgesG

1 2

2 2

3

4

4

5

3

3

2

1

A

B

C

D

E

F

10

63

76

12

6

9

10

Bina Nusantara 10

1 2

2 2

2

1

A

B

C

D

E

F

This minimum spanning tree is simple to find, but it has a very interesting application in anthropology. The paths between the islands in the MST were the safest and thus the most traveled by the ancient mariners of Oceania.

Bina Nusantara 11

According to Hage and Harary, “solutions to many network problems can be found by decomposing a graph into sub graphs…. In certain types of communication problems, a graph may be decomposed into its dominating sets.”

DOMINATING SETS

A dominating set S of a graph G has every node (vertex) of G either in it or adjacent to it. Consider this graph.

[2] page 205

{1,6,8,9} is a dominating set

Bina Nusantara 12

The Five Queens problem

A good example of a dominating set is the Five Queens problem in chess. How can one position five Queens on a chess board so that they command or occupy every square on the board without threatening each other?

Bina Nusantara 13

Another important feature of dominating sets, the minimum dominating set, illustrated by the 5 Queens problem is:

“ There may also be six, seven, or eight Queens in a minimal dominating set (so that the removal of one Queen leaves a non-dominating set). Hence the five Queens constitute a minimum dominating set. ”  

[2] page 205

The set {1,8,9} is a minimum dominating set.

Bina Nusantara 14

[2] page 205

Harary defines independent dominating sets as a set in which no nodes are adjacent.

{1,4,7,10} is an independent dominating set.

One can look at the number of nodes in each set and determine a domination number. The domination number is “the smallest number of nodes in any dominating set, hence it is the cardinality of a minimum dominating set.

In the graph on the previous slide, =3 Lastly, “the independent domination number (G) is the smallest number of nodes in any independent dominating set.

''( ) 4G

( )G

( )G

Bina Nusantara 15

How does Domination apply in Oceania?Hage and Harary apply the concept of dominating sets in the western Caroline Islands in order “to analyze distributional aspects of power relations.” They assume that, “given the traditions of warfare, conquest and hierarchy in the Carolines…all the islands in the network were either dominated or dominating.” According to Harary and , ,so there must be 4 dominating islands in the network.

( )G '( ) 4G

Bina Nusantara 16

“Elato and Satawal paid tribute to Lamotrek in return for the right to exploit neighboring uninhabited islands for marine recourses.”

“Puluwat dominated, through conquest and colonization, the neighboring islands of Pulusuk, Pulap, and Namonuito”

“Ulithi dominated Fais and Sorol in an informal but fundamental way: These two islands, alone amoung all others in the western Carolines, had, at an early date, lost their navigational skills and had to rely on Ulithi for communication with all other islands.”

Since dominating islands do not threaten each other, either Woleai or Ifaluk must make up the last member of the independent dominating set.

Bina Nusantara 17

“Woleai did not dominate its neighbors in the recent past but instead turned in on itself and developed an intra-atoll structure…We suppose that either Woleai dominated Eaurpik, Faraulep, and Ifaluk or that Ifaluk dominated Eaurpik, Faraulep or perhaps most likely, that Woleai and Ifaluk dominated at different times.”

Bina Nusantara 18

Class ExerciseA

B

C

D

E

F

G

H

I

JFind an independent dominating set and minimal dominating set in this make believe island network.

{B,E,I} and {A,F,H} are independent dominating sets with they are also a minimal dominating set. =3

'( ) 3G ( )G

Bina Nusantara 19