On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts

On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Fang Yang, Xiang-en Chen, Chunyan Ma, Bing Yao
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Clocks
Color
Educational institutions
Electronic mail
Graph theory
Information processing
Intelligent control
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/ICICIP.2013.6568058