DocumentCode
2834225
Title
The Smarandachely Adjacent-Vertex Total Coloring of Three Classes of 3-Regular Halin Graphs
Author
Li, Jingwen ; Zhang, Zhongfu ; Wang, Zhiwen ; Zhu, Enqiang ; Wen, Fei ; Yao, Bing
Author_Institution
Sch. of Inf. & Electron. Eng., Lanzhou Jiaotong Univ., Lanzhou, China
fYear
2009
fDate
11-13 Dec. 2009
Firstpage
1
Lastpage
3
Abstract
The Smarandachely adjacent-vertex total chromatic number of graph G is the smallest positive integer k for which G has a proper total k-coloring such that for any pair of adjacent vertices u, v, the set of colors appearing at vertex u and its incident edges is not a subset of the set of colors appearing at vertex v and its incident edges. This paper,we obtain the Smarandachely adjacent-vertex total chromatic numbers of three particular classes of 3-regular Halin graphs.
Keywords
graph colouring; 3-regular Halin graphs; Smarandachely adjacent-vertex total chromatic number; Smarandachely adjacent-vertex total coloring; adjacent vertices; positive integer; total k-coloring; Computer science; Information science; Mathematics; Terminology; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4507-3
Electronic_ISBN
978-1-4244-4507-3
Type
conf
DOI
10.1109/CISE.2009.5364322
Filename
5364322
Link To Document