L(2,1) Labeling on Regular Tiling of The Plane and Outerplanar Graph

Miryawati, Lina and Ratnasari, Lucia and Sumanto, Y.D. (2009) L(2,1) Labeling on Regular Tiling of The Plane and Outerplanar Graph. Undergraduate thesis, Universitas Diponegoro.

[img]
Preview
PDF
601Kb

Abstract

L(2,1)-labelingis a class of coloring problems in which adjacent nodes must receivecolors that are at least 2 apart while nodes connected by a two long path mustreceive different colors. This problem arises from assign radio frequencies to transmitterswithout causing interference. Here focus on L(2,1)-labeling restricted to subclass planar are regular tilings of the plane and outerplanar graphs. Then given algorithmlabeling each regular tiling of the plane and given algorithm for outerplanar graphs.These algorithm can be used to solve the problem of assigning frequencies tothe tranmitters of a wireless network andradio networks.

Item Type:Thesis (Undergraduate)
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:2929
Deposited By:Mr. Matematika Admin
Deposited On:22 Dec 2009 15:22
Last Modified:22 Dec 2009 15:22

Repository Staff Only: item control page