Injective edge coloring of sparse graphs with maximum degree 5

被引:0
|
作者
Junlei Zhu
Yuehua Bu
Hongguo Zhu
机构
[1] Jiaxing University,College of Data Science
[2] Zhejiang Normal University,Department of Mathematics
[3] Zhejiang Normal University Xingzhi College,undefined
来源
关键词
Maximum degree; Maximum average degree; Injective edge coloring; 05C15;
D O I
暂无
中图分类号
学科分类号
摘要
A k-injective-edge coloring of a graphG is a mapping c:E(G)→{1,2,⋯,k}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c:E(G)\rightarrow \{1,2,\cdots ,k\}$$\end{document} such that c(e1)≠c(e3)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c(e_1)\ne c(e_3)$$\end{document} for any three consecutive edges e1,e2,e3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$e_1,e_2,e_3$$\end{document} of a path or a 3-cycle. χi′(G)=min{k|G\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi _{i}'(G)=\min \{k|G$$\end{document} has a k-injective-edge coloring}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\}$$\end{document} is called the injective chromatic index ofG. In this paper, we prove that for graphs G with Δ(G)≤5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta (G)\le 5$$\end{document}, (1) χi′(G)≤8\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi _{i}'(G)\le 8$$\end{document} if mad(G)<73\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$mad(G)<\frac{7}{3}$$\end{document}; (2) χi′(G)≤9\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi _{i}'(G)\le 9$$\end{document} if mad(G)<125\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$mad(G)<\frac{12}{5}$$\end{document}; (3) χi′(G)≤10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi _{i}'(G)\le 10$$\end{document} if mad(G)<52\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$mad(G)<\frac{5}{2}$$\end{document}; (4) χi′(G)≤11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi _{i}'(G)\le 11$$\end{document} if mad(G)<187\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$mad(G)<\frac{18}{7}$$\end{document}.
引用
收藏
相关论文
共 50 条
  • [1] Injective edge coloring of sparse graphs with maximum degree 5
    Zhu, Junlei
    Bu, Yuehua
    Zhu, Hongguo
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
  • [2] Injective edge coloring of graphs with maximum degree 5?
    Zhu, Junlei
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 334 : 119 - 126
  • [3] Injective edge-coloring of graphs with given maximum degree
    Kostochka, Alexandr
    Raspaud, Andre
    Xu, Jingwei
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2021, 96
  • [4] Injective edge coloring of sparse graphs
    Bu, Yuehua
    Qi, Chentao
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (02)
  • [5] Injective edge coloring of some sparse graphs
    Lu, Jian
    Pan, Xiang-Feng
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2023, 69 (04) : 3421 - 3431
  • [6] Injective edge coloring of some sparse graphs
    Jian Lu
    Xiang-Feng Pan
    [J]. Journal of Applied Mathematics and Computing, 2023, 69 : 3421 - 3431
  • [7] On injective chromatic index of sparse graphs with maximum degree 5
    Lu, Jian
    Hong, Zhen-Mu
    Xia, Zheng-Jiang
    [J]. Journal of Combinatorial Optimization, 2024, 48 (05)
  • [8] On strong edge-coloring of graphs with maximum degree 5
    Lu, Jian
    Liu, Huiqing
    Hu, Xiaolan
    [J]. DISCRETE APPLIED MATHEMATICS, 2024, 344 : 120 - 128
  • [9] Injective Edge Coloring of Graphs
    Cardoso, Domingos M.
    Cerdeira, J. Orestes
    Dominic, Charles
    Cruz, J. Pedro
    [J]. FILOMAT, 2019, 33 (19) : 6411 - 6423
  • [10] Acyclic Edge Coloring of Graphs with Maximum Degree 4
    Basavaraju, Manu
    Chandran, L. Sunill
    [J]. JOURNAL OF GRAPH THEORY, 2009, 61 (03) : 192 - 209