DISTANCE THREE LABELINGS FOR DIRECT PRODUCTS OF THREE COMPLETE GRAPHS
- Authors
- Kim, Byeong Moon; Song, Byung Chul; Hwang, Woonjae
- Issue Date
- 2월-2013
- Publisher
- MATHEMATICAL SOC REP CHINA
- Keywords
- Distance three labeling; Radio number; Direct products; Complete graphs
- Citation
- TAIWANESE JOURNAL OF MATHEMATICS, v.17, no.1, pp.207 - 219
- Indexed
- SCIE
SCOPUS
- Journal Title
- TAIWANESE JOURNAL OF MATHEMATICS
- Volume
- 17
- Number
- 1
- Start Page
- 207
- End Page
- 219
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/104136
- DOI
- 10.11650/tjm.17.2013.1909
- ISSN
- 1027-5487
- Abstract
- The distance 3 labeling number lambda(G) (j(0), j(1), j(2)) for a graph G = (V, E) is the smallest integer alpha such that there is a function f : V -> [0, alpha], satisfying vertical bar f(u) - f (v)vertical bar >= j(delta-1) for any pair of vertices u, v of distance delta <= 3. In this paper, we determine the distance 3 labeling number lambda(G)(j, k, 1) for the direct product G = K-n x K-m x K-2 (n >= m >= 3) of 3 complete graphs under various conditions on j and k. As a consequence, we have the radio number rn(G) = 2mn 1.
- 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.