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 条
  • [1] L(2, 1)-edge labeling of Infinite Triangular Grid
    Bandopadhyay, Susobhan
    Ghosh, Sasthi C.
    Koley, Subhasis
    CEUR Workshop Proceedings, 2021, 3072 : 179 - 192
  • [2] L(D, 2, 1)-labeling of Square Grid
    Soumen Atta
    Priya Ranjan Sinha Mahapatra
    National Academy Science Letters, 2019, 42 : 485 - 487
  • [3] L(D, 2, 1)-labeling of Square Grid
    Atta, Soumen
    Mahapatra, Priya Ranjan Sinha
    NATIONAL ACADEMY SCIENCE LETTERS-INDIA, 2019, 42 (06): : 485 - 487
  • [4] L(p, 2, 1)-labeling of the infinite regular trees
    Duan, Ziming
    Miao, Lianying
    Wang, Cuiqi
    Miao, Zhengke
    DISCRETE MATHEMATICS, 2013, 313 (20) : 2330 - 2336
  • [5] L(1,2)-labeling numbers on square of cycles
    Liu, Le
    Wu, Qiong
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 915 - 919
  • [6] L(1,2)-edge-labelings for lattices
    He Dan
    Lin Wen-song
    APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B, 2014, 29 (02) : 230 - 240
  • [7] Optimal L(3,2,1)-labeling of trees
    Zhang, Xiaoling
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2024, 21 (03) : 310 - 314
  • [8] An explicit construction of optimal dominating and [1,2]-dominating sets in grid
    Sharifani, P.
    Hooshmandasl, M. R.
    Meybodi, M. Alambardar
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 870 - 876
  • [9] Optimal L(δ1, δ2, 1)-labeling of eight-regular grids
    Calamoneri, Tiziana
    INFORMATION PROCESSING LETTERS, 2013, 113 (10-11) : 361 - 364
  • [10] Optimal L(j, k)-Edge-Labeling of Regular Grids
    Calamoneri, Tiziana
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (04) : 523 - 535
12345