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 条
  • [21] Note on injective edge-coloring of graphs
    Miao, Zhengke
    Song, Yimin
    Yu, Gexin
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 310 : 65 - 74
  • [22] Complexity and algorithms for injective edge coloring of graphs
    Priyamvada, B. S.
    Panda, B. S.
    [J]. THEORETICAL COMPUTER SCIENCE, 2023, 968
  • [23] Injective edge-coloring of subcubic graphs
    Ferdjallah, Baya
    Kerdjoudj, Samia
    Raspaud, Andre
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2022, 14 (08)
  • [24] Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
    Hocquard, Herve
    Montassier, Mickael
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (01) : 152 - 160
  • [25] On the size of edge-coloring critical graphs with maximum degree 4
    Miao, Lianying
    Pang, Shiyou
    [J]. DISCRETE MATHEMATICS, 2008, 308 (23) : 5856 - 5859
  • [26] Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
    Hervé Hocquard
    Mickaël Montassier
    [J]. Journal of Combinatorial Optimization, 2013, 26 : 152 - 160
  • [27] List strong edge coloring of planar graphs with maximum degree 4
    Chen, Ming
    Hu, Jie
    Yu, Xiaowei
    Zhou, Shan
    [J]. DISCRETE MATHEMATICS, 2019, 342 (05) : 1471 - 1480
  • [28] Edge-Face Coloring of Plane Graphs with Maximum Degree Nine
    Sereni, Jean-Sebastien
    Stehlik, Matej
    [J]. JOURNAL OF GRAPH THEORY, 2011, 66 (04) : 332 - 346
  • [29] List strong edge-coloring of graphs with maximum degree 4
    Zhang, Baochen
    Chang, Yulin
    Hu, Jie
    Ma, Meijie
    Yang, Donglei
    [J]. DISCRETE MATHEMATICS, 2020, 343 (06)
  • [30] Randomly coloring sparse random graphs with fewer colors than the maximum degree
    Dyer, Martin
    Flaxman, Abraham D.
    Frieze, Alan M.
    Vigoda, Eric
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2006, 29 (04) : 450 - 465