Packing Chromatic Number of Base-3 Sierpiński Graphs

被引:0
|
作者
Boštjan Brešar
Sandi Klavžar
Douglas F. Rall
机构
[1] University of Maribor,Faculty of Natural Sciences and Mathematics
[2] Institute of Mathematics,Faculty of Mathematics and Physics
[3] Physics and Mechanics,Department of Mathematics
[4] University of Ljubljana,undefined
[5] Furman University,undefined
来源
Graphs and Combinatorics | 2016年 / 32卷
关键词
Packing; Packing chromatic number; Sierpiński graphs; 05C70; 05C15;
D O I
暂无
中图分类号
学科分类号
摘要
The packing chromatic number χρ(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi _{\rho }(G)$$\end{document} of a graph G is the smallest integer k such that there exists a k-vertex coloring of G in which any two vertices receiving color i are at distance at least i+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i+1$$\end{document}. Let Sn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^n$$\end{document} be the base-3 Sierpiński graph of dimension n. It is proved that χρ(S1)=3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi _{\rho }(S^1) = 3$$\end{document}, χρ(S2)=5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi _{\rho }(S^2) = 5$$\end{document}, χρ(S3)=χρ(S4)=7\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi _{\rho }(S^3) = \chi _{\rho }(S^4) = 7$$\end{document}, and that 8≤χρ(Sn)≤9\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$8\le \chi _\rho (S^n) \le 9$$\end{document} holds for any n≥5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\ge 5$$\end{document}.
引用
收藏
页码:1313 / 1327
页数:14
相关论文
共 50 条
  • [1] Packing Chromatic Number of Base-3 SierpiA"ski Graphs
    Bresar, Bostjan
    Klavzar, Sandi
    Rall, Douglas F.
    [J]. GRAPHS AND COMBINATORICS, 2016, 32 (04) : 1313 - 1327
  • [2] On the packing coloring of base-3 Sierpiński graphs and H-graphs
    Fei Deng
    Zehui Shao
    Aleksander Vesel
    [J]. Aequationes mathematicae, 2021, 95 : 329 - 341
  • [3] Packing coloring of Sierpiński-type graphs
    Boštjan Brešar
    Jasmina Ferme
    [J]. Aequationes mathematicae, 2018, 92 : 1091 - 1118
  • [4] On the packing coloring of base-3 Sierpinski graphs and H-graphs
    Deng, Fei
    Shao, Zehui
    Vesel, Aleksander
    [J]. AEQUATIONES MATHEMATICAE, 2021, 95 (02) : 329 - 341
  • [5] Distances in Sierpiński graphs and on the Sierpiński gasket
    Ligia L. Cristea
    Bertran Steinsky
    [J]. Aequationes mathematicae, 2013, 85 : 201 - 219
  • [6] The Hub Number of Sierpiński-Like Graphs
    Chien-Hung Lin
    Jia-Jie Liu
    Yue-Li Wang
    William Chung-Kung Yen
    [J]. Theory of Computing Systems, 2011, 49 : 588 - 600
  • [7] The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs
    Jia-Jie Liu
    Shun-Chieh Chang
    Chiou-Jiun Lin
    [J]. Theory of Computing Systems, 2017, 61 : 893 - 906
  • [8] Graphs that are Critical for the Packing Chromatic Number
    Bresar, Bostjan
    Ferme, Jasmina
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2022, 42 (02) : 569 - 589
  • [9] Packing chromatic number of cubic graphs
    Balogh, Jozsef
    Kostochka, Alexandr
    Liu, Xujun
    [J]. DISCRETE MATHEMATICS, 2018, 341 (02) : 474 - 483
  • [10] PACKING CHROMATIC NUMBER OF TRANSFORMATION GRAPHS
    Durgun, Derya D.
    Ozen Dortok, H. Busra
    [J]. THERMAL SCIENCE, 2019, 23 : S1991 - S1995