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

TL;DRAbstract

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.

Chat with Paper

AI Agents for this Paper