JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2021, Vol. 56 ›› Issue (11): 83-86.doi: 10.6040/j.issn.1671-9352.0.2020.198

Previous Articles    

2-distance sum distinguishing edge coloring of K4-minor-free graphs

QIANG Hui-ying, YAO Li*   

  1. School of Mathematics and Physics, Lanzhou Jiaotong University, Lanzhou 730070, Gansu, China
  • Published:2021-11-15

PDF (PC)

210

Abstract: Let φ be a proper edge coloring of graph G, for any u,v∈V(G), if dG(u,v)≤2 such that f(u)≠f(v) where f(u)=∑uw∈E(G)φ(uw), then φ is the 2-distance sum distinguishing edge coloring of graph G. The 2-distance sum distinguishing edge coloring of K4-minor-free graphs are studied by using the methods of contradiction and constructing coloring function, and a upper bound of the 2-distance sum distinguishing edge chromatic number of K4-minor-free graphs is obtained.

Key words: 2-distance sum distinguishing edge coloring, 2-distance sum distinguishing edge chromatic, K4-minor-free graphs

CLC Number: 

  • O157.5
[1] ZHANG Z F, LIU L Z, WANG J F. Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters, 2002, 15(5):623-626.
[2] 王维凡, 王平. 没有K4-图子式的图的邻点可区别全染色[J]. 中国科学(A辑: 数学), 2009, 39(12):1462-1472. WANG Weifan, WANG Ping. Neighbor vertex distinguishing total coloring of graphs[J]. Science in China(Series A: Mathematics), 2009, 39(12):1462-1472.
[3] 史小艺,张宁,万慧敏. K4-minor-free图的邻点可区别全染色[J]. 五邑大学学报,2012,26(4):9-13. SHI Xiaoyi, ZHANG Ning, WAN Huimin. K4-minor-free neighbor vertex distinguishing total coloring of graphs[J]. Journal of Wuyi University(Natural Science Edition), 2012, 26(4):9-13.
[4] WANG W F, WANG Y Q. Adjacent vertex-distinguishing edge colorings of K4-minor free graphs[J]. Applied Mathematics Letters, 2011, 24(12):2034-2037.
[5] FLANDRIN E, MARCZYK A, PRZYBYŁO J, et al. Neighbor sum distinguishing index[J]. Graphs and Combinatorics, 2013, 29(5):1329-1336.
[6] WANG G H, YAN G Y. An improved upper bound for the neighbor sum distinguishing index of graphs[J]. Discrete Applied Mathematics, 2014, 175:126-128.
[7] DONG A J, WANG G H, ZHANG J H. Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree[J]. Discrete Applied Mathematics, 2014, 166: 84-90.
[8] DONG A J, WANG G H. Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree[J]. Acta Mathematica Sinica, English Series, 2014, 30(4):703-709.
[9] LI H L, LIU B Q, WANG G H. Neighbor sum distinguishing total colorings of K4-minor free graphs[J]. Frontiers of Mathematics in China, 2013, 8(6):1351-1366.
[10] ZHANG J H, DING L H, WANG G H, et al. Neighbor sum distinguishing index of K4-minor free graphs[J]. Graphs and Combinatorics, 2016, 32(4):1621-1633.
[1] XIE Cheng-ling, MA Hai-cheng. Matching equivalent classes of union graphs of two vertices and a path [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(1): 29-34.
[2] LI Jing-jing, BIAN Hong, YU Hai-zheng. Maximum matching forcing number in some special graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(10): 71-76.
[3] WEI Zong-tian, FANG Hui, LI Yin-kui. On the facility systems reliability based on network location [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(10): 77-82.
[4] LIU Jia, SUN Lei. Planar graphs without 4-cycle or chordal-6-cycle are(3,0,0)-colorable [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 31-40.
[5] . Vertex-distinguishing E-total coloring of complete bipartite graph K10,n with 10≤n≤90 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 23-30.
[6] ZHANG You, HUANG Li-na, LI Mu-chun. Vertex distinguishing edge coloring of a hexagonal system [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 41-47.
[7] CHEN Hong-ling, WANG Hui-juan, GAO Hong-wei. Linear arboricity of graphs embedded in a surface of non-negative Euler characteristic [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 17-22.
[8] LI Mei-lian, DENG Qing-ying. Maple calculation of the transition polynomial of plane graph [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(10): 27-34.
[9] LIU Xiao-hua, MA Hai-cheng. Order of matching energy and Hosoya index of Q-shape graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(8): 61-65.
[10] . Vertex-distinguishing IE-total coloring and general-total coloring of K1,3,p and K1,4,p [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(8): 53-60.
[11] CHEN Hong-yu, ZHANG Li. Linear 2-arboricity of planar graphs with 4-cycles have no common vertex [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(12): 36-41.
[12] HE Yu-ping, WANG Zhi-wen, CHEN Xiang-en. Vertex-distinguishing total coloring of mC8 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(10): 24-30.
[13] LI Ting-ting, LAO Hui-xue. On the mean value of a hybrid arithmetic function [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(8): 70-74.
[14] WANG Xiao-li, WANG Hui-juan, LIU Bin. Total coloring of planar graphs with maximum degree seven [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(8): 100-106.
[15] CHEN Xiang-en, MIAO Ting-ting, WANG Zhi-wen. Vertex-distinguishing I-total colorings of the join of two paths [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(4): 30-33.
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