Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Radio number for the product of a path and a complete graph
- Issue Date
- 7월-2015
- Publisher
- SPRINGER
- Keywords
- Multilevel distance labeling; Channel assignment problem; Radio number; Cartesian product
- Citation
- JOURNAL OF COMBINATORIAL OPTIMIZATION, v.30, no.1, pp.139 - 149
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF COMBINATORIAL OPTIMIZATION
- Volume
- 30
- Number
- 1
- Start Page
- 139
- End Page
- 149
- ISSN
- 1382-6905
- Abstract
- A multilevel distance labeling of a graph is a function on into such that for all . The radio number of is the minimum span over all multilevel distance labelings of . In this paper, we completely determine the radio number of where is the Cartesian product of a path with vertices and a complete graph with vertices.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Hwang, Woon Jae
- 과학기술대학 (응용수리과학부 데이터계산과학전공)