DocumentCode :
624594
Title :
On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts
Author :
Fang Yang ; Xiang-en Chen ; Chunyan Ma ; Bing Yao
Author_Institution :
Coll. of Math. & Stat., Northwest Normal Univ., Lanzhou, China
fYear :
2013
fDate :
9-11 June 2013
Firstpage :
150
Lastpage :
154
Abstract :
In this paper, we discuss the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts. We denote by K(p × q) the complete p-partite graph with cardinality q of each part. By constructing coloring in terms of the symmetry of regular polygons and the methods of combinatorial analysis, we will obtain vertex-distinguishing proper total chromatic numbers for K(p × q) when q = 2, 3, 4, 5, respectively.
Keywords :
graph colouring; combinatorial analysis; complete p-partite graphs; equipotent parts; regular polygons; vertex-distinguishing proper total chromatic numbers; vertex-distinguishing proper total colorings; Clocks; Color; Educational institutions; Electronic mail; Graph theory; Information processing; Intelligent control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control and Information Processing (ICICIP), 2013 Fourth International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4673-6248-1
Type :
conf
DOI :
10.1109/ICICIP.2013.6568058
Filename :
6568058
Link To Document :
بازگشت