L(3, 2, 1)-LABELING FOR CYLINDRICAL GRID: THE CARTESIAN PRODUCT OF A PATH AND A CYCLE
- Authors
- Kim, Byeong Moon; Wang, Woonjae H.; Song, Byung Chul
- Issue Date
- 6월-2017
- Publisher
- KANGWON-KYUNGKI MATHEMATICAL SOC
- Keywords
- L(3,2,1)-labeling; cartesian products; graph labeling
- Citation
- KOREAN JOURNAL OF MATHEMATICS, v.25, no.2, pp.279 - 301
- Indexed
- KCI
- Journal Title
- KOREAN JOURNAL OF MATHEMATICS
- Volume
- 25
- Number
- 2
- Start Page
- 279
- End Page
- 301
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/83310
- DOI
- 10.11568/kjm.2017.25.2.279
- ISSN
- 1976-8605
- Abstract
- An L(3,2,1)-labeling for the graph G = (V,E) is an assignment f of a label to each vertices of G such that |f(u) - f(v)| >= 4 - k when dist (u,v) = k <= 3. The L(3,2,1)-labeling number, denoted by lambda 3,2,1(G), for G is the smallest number N such that there is an L(3,2,1)-labeling for G with span N. In this paper, we compute the L(3,2,1)-labeling number lambda 3,2,1(G) when G is a cylindrical grid, which is the cartesian product P-m rectangle C-n of the path and the cycle, when m >= 4 and n >= 138. Especially when n is a multiple of 4, or m = 4 and n is a multiple of 6, then we have lambda 3,2,1(G) - 11. Otherwise lambda 3,2,1(G) - 12.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science and Technology > Data Computational Sciences in Division of Applied Mathematical Sciences > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.