JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2015, Vol. 50 ›› Issue (02): 5-8.doi: 10.6040/j.issn.1671-9352.0.2014.137

Previous Articles     Next Articles

Several conclusions of adjacent vertex distinguishing E-total coloring of the cartesian product graphs

LIU Xin-sheng1, DENG Wei-dong1, WANG Zhi-qiang2   

  1. 1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, Gansu, China;
    2. The High School Attached to Northwest Normal University, Lanzhou 730070, Gansu, China
  • Received:2014-04-03 Revised:2014-10-14 Online:2015-02-20 Published:2015-01-27

PDF (PC)

1042

Abstract: By using of the analysis method, the adjacent vertex distinguishing E-total coloring of the cartesian product graphs are studied, and the adjacent vertex distinguishing E-total chromatic numbers for the cartesian products of the graphs with chromatic number at least 2 or the graphs with adjacent vertex distinguishing E-total chromatic numbers 3 or 4 are discussed, some relevant conclusions are also obtained.

Key words: the chromatic numbers, the cartesian product graph, the adjacent vertex distinguishing E-total coloring, the adjacent vertex distinguishing E-total chromatic number

CLC Number: 

  • O157.5
[1] ZHANG Zhongfu, LIU Linzhong, WANG Jianfang. Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letter, 2002, 15:623-626.
[2] ZHANG Zhongfu, CHEN Xiangen, LI jingwen, et al. On adjacent-vertex-distinguishing total coloring of graphs[J]. Science in China, Ser. A Mathematics, 2005, 48(3):289-299.
[3] CHEN Xiangen, GAO Yuping, YAO Bing. Not necessarily proper total colourings which are adjacent vertex distinguishing[J]. International Journal of Computer Mathematics, 2013, 90(11):2298-2307.
[4] 李沐春, 张忠辅. 一类多重联图的邻点可区别E-全染色[J]. 纯粹数学与应用数学, 2010, 26(1):36-41. LI Muchun, ZHANG Zhongfu. Adjacent vertex-distinguishing E-total Coloring on a class of the multiple join Graphs[J]. Pure and Applied Mathematics, 2010, 26(1):36-41.
[5] 李沐春, 张忠辅. 若干笛卡尔积图的邻点可区别E-全染色[J]. 数学实践与认识, 2009,39(3):215-219. LI Muchun, ZHANG Zhongfu. Adjacent Vertex-distinguishing E-total Coloring on Product of Graphs of Some Graphs[J]. Mathematics in Practice and Theory, 2009, 39(3):215-219.
[6] BONDY J A, MURTY U S R. Graph Theory[M]. New York: Springer, 2008.
[7] WEST Douglas B. 图论导引[M]. 李建中,骆吉洲,译. 北京: 机械工业出版社, 2006.2.
[1] 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.
[2] . 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.
[3] 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.
[4] 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.
[5] 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.
[6] 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.
[7] 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.
[8] 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.
[9] WANG Ye, SUN Lei. Every 1-planar graph without cycles of length 3 or 4 is 5-colorable [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(4): 34-39.
[10] MA Hai-cheng, LI Sheng-gang. The digraphs representation of finite topologies [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(4): 100-104.
[11] ZHU Xiao-ying, PANG Shi-you. On the maximal eccentric distance sum of tree with given domination number [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(2): 30-36.
[12] YANG Chun-hua, CAI Jian-sheng. Classification on f-coloring of graphs with some restrictions [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(2): 37-38.
[13] LI Shi-ling, CHEN Xiang-en, WANG Zhi-wen. Vertex-Distinguishing E-Total coloring of complete bipartite graph K3,n with n≥18 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(4): 68-71.
[14] ZHU Hai-yang, GU Yu, LÜ Xin-zhong. New upper bound on the chromatic number of the square of a planar graph [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(2): 94-101.
[15] GUAN Ai-xia, LI Fang, LI Guo-quan. An exponential upper tail bound for the deviation of induced degrees [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(12): 73-75.
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