Optimal L(1,2)-edge Labeling of Infinite Octagonal Grid

被引：0
|
作者：
Koley, Subhasis [1 ]
Ghosh, Sasthi C. [1 ]
机构：
[1] Advanced Computing and Microelectronics unit, Indian Statistical Institute, 203 B. T. Road, Kolkata,700108, India
来源：
arXiv | 2022年
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Combinatorial optimization
引用
收藏
相关论文
共 50 条
  • [31] L(2,1)-LABELING OF TRAPEZOID GRAPHS
    Paul, S.
    Amanathulla, S. K.
    Pal, M.
    Pal, A.
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2024, 14 (03): : 1254 - 1263
  • [32] L(2,1)-labeling of a circular graph
    Ma, Dengju
    Ren, Han
    Lv, Damei
    ARS COMBINATORIA, 2015, 123 : 231 - 245
  • [33] The L(2,1)-labeling problem on graphs
    Chang, GJ
    Kuo, D
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1996, 9 (02) : 309 - 316
  • [34] L(2,1)-labeling of interval graphs
    Paul S.
    Pal M.
    Pal A.
    Journal of Applied Mathematics and Computing, 2015, 49 (1-2) : 419 - 432
  • [35] The L(2,1)-labeling problem on ditrees
    Chang, GJ
    Liaw, SC
    ARS COMBINATORIA, 2003, 66 : 23 - 31
  • [36] The L(3, 2, 1)-Labeling Problem for Trees
    Xiaoling ZHANG
    Journal of Mathematical Research with Applications, 2020, 40 (05) : 467 - 475
  • [37] L(2,1)-labeling of Block Graphs
    Panda, B. S.
    Goel, Preeti
    ARS COMBINATORIA, 2015, 119 : 71 - 95
  • [38] The (2,1)-Edge Labeling Problem on Direct Product of Graphs
    Shao, Zhendong
    Averbakh, Igor
    ARS COMBINATORIA, 2020, 149 : 225 - 244
  • [39] Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
    Kezdy, AE
    Wang, C
    DISCRETE MATHEMATICS, 1999, 194 (1-3) : 261 - 265
  • [40] Edge decomposition into isomorphic copies of sK(1,2) is polynomial
    Lonc, Z
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 69 (02) : 164 - 182
12345