상세 보기
Radio number for the product of a path and a complete graph
- Kim, Byeong Moon;
- Hwang, Woonjae;
- Song, Byung Chul
Citations
WEB OF SCIENCE
15Citations
SCOPUS
28초록
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.
키워드
Multilevel distance labeling; Channel assignment problem; Radio number; Cartesian product; K)-LABELING PROBLEM; LABELING GRAPHS; L(H
- 제목
- Radio number for the product of a path and a complete graph
- 저자
- Kim, Byeong Moon; Hwang, Woonjae; Song, Byung Chul
- 발행일
- 2015-07
- 유형
- Article
- 권
- 30
- 호
- 1
- 페이지
- 139 ~ 149