单圈图的D(2)-点可区别边染色

吉林大学学报(理学版) ›› 2021, Vol. 59 ›› Issue (4): 807-815.

单圈图的D(2)-点可区别边染色

贾秀卿, 李沐春

兰州交通大学应用数学研究所, 兰州 730070

收稿日期:2020-11-03 出版日期:2021-07-26 发布日期:2021-07-26
通讯作者: 李沐春 E-mail:limuchunmath2@163.com

D(2)-Vertex-Distinguishing Edge Coloring of Unicyclic Graphs

JIA Xiuqing, LI Muchun

Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China

Received:2020-11-03 Online:2021-07-26 Published:2021-07-26

摘要/Abstract

摘要： 用数学归纳法、反证法及构造具体染色函数法, 并结合Hall定理讨论单圈图的D(2)-点可区别边染色, 并给出其确切的D(2)-点可区别边色数.

关键词: 单圈图, 边染色, D(2)-点可区别边染色, D(2)-点可区别边色数

Abstract: By using mathematical induction, reductio ad absurdum as well as construction of specific coloring function, together with Hall theorem, we discussed the D(2)-vertex-distinguishing edge coloring of unicyclic graphs, and gave their precise D(2)-vertex-distinguishing edge chromatic numbers.

Key words: unicyclic graph, edge-coloring, D(2)-vertex-distinguishing edge coloring, D(2)-vertex-distinguishing edge chromatic number

中图分类号:

O157.5

贾秀卿, 李沐春. 单圈图的D(2)-点可区别边染色[J]. 吉林大学学报(理学版), 2021, 59(4): 807-815.

JIA Xiuqing, LI Muchun. D(2)-Vertex-Distinguishing Edge Coloring of Unicyclic Graphs[J]. Journal of Jilin University Science Edition, 2021, 59(4): 807-815.

[1]	顾彦波, 李敬文, 王露露. 图形密码中一类特殊图的几种标号[J]. 吉林大学学报(理学版), 2020, 58(2): 293-300.
[2]	陈祥恩, 高毓平. 合成图的点可区别正常边色数[J]. J4, 2011, 49(02): 207-212.
[3]	王鸿杰, 王治文, 朱恩强, 文飞, 李敬文. K_n-{v₁v₂,v₃v₄,v₅v₆,v₇v₈}(n≥20, n≡0(mod2))的点可区别边色数[J]. J4, 2010, 48(05): 777-782.
[4]	王萃琦, 苗正科. 一类正则图的邻强边染色[J]. J4, 2008, 46(03): 457-460.