Journal of Jilin University Science Edition

Previous Articles     Next Articles

Vertex Strongly Distinguishing Total Coloringof Complete Bipartite Graph K6,8

WANG Beibei1, QI Lijuan2, LIU Xinsheng1, CHEN Xiang’en1   

  1. 1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China;2. Department of Basic Courses, Lanzhou Insititute of Technology, Lanzhou 730050, China
  • Received:2015-11-23 Online:2016-09-26 Published:2016-09-19
  • Contact: QI Lijuan E-mail:282455295@qq.com

PDF (PC)

229

Like

Abstract:

By using the method of combinatorial analysis, we considered the vertex strongly distinguishing total coloring schemes of complete bipartite graph K6,8, and gave a feasible coloring scheme. The results show that the vertex strongly distinguishing total chromatic number of complete bipartite graph K6,8 is equal to ten.

Key words: complete bipartite graph, vertex strongly distinguishing total coloring, vertex strongly distinguishing total chromatic number

CLC Number: 

  • O157.5
Copyright © Journal of Jilin University Science Edition, All Rights Reserved.
Tel: +86-431-88499428　E-mail: sejuj@jlu.edu.cn
Powered by Beijing Magtech Co. Ltd