DocumentCode :
1876688
Title :
On the Equitable Total Colorings of Sm V Pn V Pn
Author :
Tian, Jing-jing
Author_Institution :
Dept. of Math., Shaanxi Univ. of Technol., Hanzhong, China
fYear :
2010
fDate :
10-12 Dec. 2010
Firstpage :
1
Lastpage :
4
Abstract :
The equitable total chromatic number of a graph G is the smallest integer k for which G has a k-total coloring such that the number of vertices and edges colored with each color differs by at most one. In this paper , the equitable total coloring of Sm V Pn V Pn has been studied and the equitable total chromatic number of Sm V Pn V Pn has been obtained.
Keywords :
graph colouring; equitable total chromatic number; equitable total coloring; graph coloring; Bipartite graph; Color; Scientific computing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Software Engineering (CiSE), 2010 International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-5391-7
Electronic_ISBN :
978-1-4244-5392-4
Type :
conf
DOI :
10.1109/CISE.2010.5677022
Filename :
5677022
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1876688
بازگشت