文章基本信息

标题：The Equitable Total Chromatic Number of Some Join graphs
本地全文：下载
作者：Gang MA ; Ming MA
期刊名称：Open Journal of Applied Sciences
印刷版ISSN：2165-3917
电子版ISSN：2165-3925
出版年度：2012
卷号：2
期号：4B
页码：96-99
DOI：10.4236/ojapps.2012.24B023
出版社：Scientific Research Publishing
摘要：A proper total-coloring of graph G is said to be equitable if the number of elements (vertices and edges) in any two color classes differ by at most one, which the required minimum number of colors is called the equitable total chromatic number. In this paper, we prove some theorems on equitable total coloring and derive the equitable total chromatic numbers of Pm V Sn, Pm V Fn and Pm V Wn.
关键词：join graph; equitable total coloring; equitable total chromatic numbers