Adjacent-vertex-distinguishing proper total colouring number of

2nd International Conference on Materials Science, Energy Technology and Environmental Engineering

材料科学;能源学;生态环境科学

Liu, Shunqin^1

School of Information and Technology, Xiamen University Tan Kah Kee College, Zhangzhou

363105, China^1

关键词: Adjacent vertices;    Edge coloring;    Engineering design;    Graph class;    Scientific computation;    Total coloring;   

Others  :  https://iopscience.iop.org/article/10.1088/1755-1315/81/1/012211/pdf
DOI  :  10.1088/1755-1315/81/1/012211

来源: IOP

【 摘 要 】

Coloring is a fundamental problem in scientific computation and engineering design. In recent years, a variety of colorings frequently appeared and solved many problems in production. For example, adjacent-vertex-distinguishing proper total coloring, adjacent-vertexdistinguishing proper edge coloring, smarandachely-adjacent-vertex-distinguishing proper edge coloring. It is an important also difficult problem to discuss the coloring numbers of a given graph class. And we focus on the adjacent-vertex-distinguishing proper total coloring numbers in this paper. We study the adjacent-vertex-distinguishing proper total coloring numbers of joint graphs K¯mV Pn.