JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2022, Vol. 57 ›› Issue (2): 78-83.doi: 10.6040/j.issn.1671-9352.0.2021.649

Previous Articles    

Neighbor sum distinguishing edge coloring of unicyclic graphs

TAN Jun-ming1, QIANG Hui-ying1*, WANG Hong-shen2   

  1. 1. College of Mathematics and Physics, Lanzhou Jiaotong University, Lanzhou 730070, Gansu, China;
    2. School of Mechanical and Electrical Engineering, Lanzhou University of Technology, Lanzhou 730050, Gansu, China
  • Published:2022-01-07

PDF (PC)

190

Abstract: A proper k-edge coloring of graph G is a k-neighbor sum distinguishing edge coloring if the sum of all elements in the colors sets of any two adjacent vertices is different. The smallest value k is called the neighbor sum distinguishing edge chromatic number of G. The neighbor sum distinguishing edge chromatic numbers of unicyclic graphs are studied by the methods of analysis and mathematical induction.

Key words: unicyclic graph, neighbor sum distinguishing edge coloring, neighbor sum distinguishing edge chromatic number

CLC Number: 

  • O157.5
[1] FLANDRIN E, MARCZYK A, PRZYBYLO J, et al. Neighbor sum distinguishing index[J]. Graphs and Combinatorics, 2013, 29(5):1329-1336.
[2] ZHANG Jianghua, DING Laihao, WANG Guanghui, et al. Neighbor sum distinguishing index of K4-minor free graphs[J]. Graphs and Combinatorics, 2016, 32(4):1621-1633.
[3] 潘文华,徐常青. 无K4-图子式的图的邻和可区别边染色[J]. 数学进展, 2017, 46(6):41-49. PAN Wenhua, XU Changqing. Neighbor sum distinguishing edge colorings of K4-minor free graphs[J]. Advances in Mathematics(China), 2017, 46(6):41-49.
[4] 强会英. 点可区别全色数的一个界[J]. 山东大学学报(理学版), 2011, 46(6):53-56. QIANG Huiying. A bound of the vertex-distinguishing total chromatic number of graphs[J]. Journal of Shandong University(Natural Science), 2011, 46(6):53-56.
[5] 杨笑蕊,强会英,李雨虹. 两类冠图的邻和可区别全染色[J]. 兰州交通大学学报, 2019, 38(5):114-117. YANG Xiaorui, QIANG Huiying, LI Yuhong. Neighbor sum distinguishing total coloring of two types of corona graphs[J]. Journal of Lanzhou Jiaotong University, 2019, 38(5):114-117.
[6] 姚丽,强会英,杨笑蕊. 两类笛卡尔积图的邻和可区别全染色[J]. 兰州交通大学学报, 2020, 39(3):125-129,166. YAO Li, QIANG Huiying, YANG Xiaorui. The neighbor sum distinguishing total coloring of two types cartesian graph[J]. Journal of Lanzhou Jiaotong University, 2020, 39(3):125-129,166.
[7] 王坤,宁文杰,潘向峰. 单圈图及其与完全图联图的全染色[J]. 合肥学院学报(自然科学版), 2012, 22(3):21-23,34. WANG Kun, NING Wenjie, PAN Xiangfeng. On the total coloring of unicyclic graph and the join graph of unicyclic graph and complete graph[J]. Journal of Hefei University(Natural Sciences), 2012, 22(3):21-23,34.
[8] 杨青,田双亮,索郎王青. 无限网格图的邻和可区别边染色[J]. 宁夏师范学院学报, 2018, 39(7):18-21,30. YANG Qing, TIAN Shuangliang, SUO Langwangqing. Neighbor sum distinguishing edge coloring of infinite lattices[J]. Journal of Ningxia Normal University, 2018, 39(7):18-21,30.
[9] 田双亮, 杨环, 杨青, 等. 路的联的邻和可区别边染色[J]. 山东大学学报(理学版), 2020, 55(9):29-35. TIAN Shuangliang, YANG Huan, YANG Qing, et al. Neighbor sum distinguishing edge coloring of the join of paths[J].Journal of Shandong University(Natural Science), 2020, 55(9):29-35.
[10] 潘文华. 若干图的邻和可区别边染色[D]. 天津:河北工业大学, 2016. PAN Wenhua. Neighbor sum distinguishing edge coloring of some graphs[D]. Tianjin: Hebei University of Technology, 2016.
[11] 霍京京. 图的邻点及邻和可区别染色[D]. 苏州:苏州大学, 2017. HUO Jingjing. On neighbor distinguishing coloring and neighbor sum distinguishing coloring of graphs[D]. Suzhou: Soochow University, 2017.
[1] WANG Bi-mei, LI Jing-wen, GU Yan-bo, SHAO Shu-hong. Edge-magic total labeling of unicyclic graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(9): 42-50.
[2] TIAN Shuang-liang, YANG Huan, YANG Qing, SUOLANG Wang-qing. Neighbor sum distinguishing edge coloring of the join of paths [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(9): 29-35.
[3] PAN Wen-hua, XU Chang-qing. Neighbor sum distinguishing index of a kind of sparse graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(8): 94-99.
[4] CAI Hua, MIAO Jie. Edge average Wiener index of unicyclic graphs of order n [J]. J4, 2012, 47(10): 70-74.
[5] QIN Jian,ZHANG Yan . Dynamic chromatic number of unicyclic graphs and bicyclic graphs [J]. J4, 2007, 42(10): 37-40 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd