Radio number for the product of a path and a complete graph

被引：14
|
作者：
Kim, Byeong Moon [1 ]
Hwang, Woonjae [2 ]
Song, Byung Chul [1 ]
机构：
[1] Gangneung Wonju Natl Univ, Dept Math, Kangnung 210702, South Korea
[2] Korea Univ, Dept Math & Informat, Sejong 339700, South Korea
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2015年 / 30卷 / 01期
关键词：
Multilevel distance labeling; Channel assignment problem; Radio number; Cartesian product; K)-LABELING PROBLEM; LABELING GRAPHS; L(H;
D O I：
10.1007/s10878-013-9639-3
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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.
引用
收藏
页码：139 / 149
页数：11
相关论文
共 50 条
  • [1] Radio number for the product of a path and a complete graph
    Byeong Moon Kim
    Woonjae Hwang
    Byung Chul Song
    Journal of Combinatorial Optimization, 2015, 30 : 139 - 149
  • [2] The crossing number of Cartesian product of sunlet graph with path and complete bipartite graph
    Alhajjar, Mhaid
    Panda, Amaresh Chandra
    Behera, Siva Prasad
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (01)
  • [3] The bondage number of the strong product of a complete graph with a path and a special starlike tree
    Zhao, Weisheng
    Zhang, Heping
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2016, 8 (01)
  • [4] On identifying codes in the Cartesian product of a path and a complete graph
    Jason Hedetniemi
    Journal of Combinatorial Optimization, 2016, 31 : 1405 - 1416
  • [5] Identifying Codes in the Direct Product of a Path and a Complete Graph
    Shinde, N. V.
    Mane, S. A.
    Waphare, B. N.
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023, 43 (02) : 463 - 486
  • [6] On the partition dimension of comb product of path and complete graph
    Darmaji
    Alfarisi, Ridho
    INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION: EMPOWERING ENGINEERING USING MATHEMATICS, 2017, 1867
  • [7] On identifying codes in the Cartesian product of a path and a complete graph
    Hedetniemi, Jason
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1405 - 1416
  • [8] On the crossing number for Kronecker product of a tripartite graph with path
    Shanthini, N.
    Babujee, J. Baskar
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 892 - 898
  • [9] The basis number of the direct product of a theta graph and a path
    Jaradat, MMM
    ARS COMBINATORIA, 2005, 75 : 105 - 111
  • [10] THE NON-ISOLATED RESOLVING NUMBER OF A GRAPH CARTESIAN PRODUCT WITH A COMPLETE GRAPH
    Hasibuan, I. M.
    Salman, A. N. M.
    Saputro, S. W.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2022, 91 (03): : 191 - 204
12345