DocumentCode :
3106168
Title :
The Smarandachely Strong Adjacent Vertex Total Coloring of Join Graph
Author :
Wang, Zhiwen ; Zhang, Zhongfu
Author_Institution :
Sch. of Math. & Comput. Sci., Ningxia Univ., Yinchuan, China
fYear :
2010
fDate :
18-20 June 2010
Firstpage :
1
Lastpage :
3
Abstract :
The Smarandachely Strong adjacent vertex total chromatic number of graph G=(V,E) is the smallest number of colors assignable to E and V so that any two adjacent vertices u and v satisfying: |C(u) C(υ)| ≥ 2 and |C(v) C(u)| ≥ 2.Obviously,this chromatic is exist when d(G) > 3.1n this paper,we obtain the Smarandachely Strong adjacent vertex total chromatic number of Sm + Fn in some conditions.
Keywords :
graph colouring; Smarandachely strong adjacent vertex total chromatic number; Smarandachely strong adjacent vertex total coloring; join graph; Counting circuits; Mathematics; Terminology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Bioinformatics and Biomedical Engineering (iCBBE), 2010 4th International Conference on
Conference_Location :
Chengdu
ISSN :
2151-7614
Print_ISBN :
978-1-4244-4712-1
Electronic_ISBN :
2151-7614
Type :
conf
DOI :
10.1109/ICBBE.2010.5515747
Filename :
5515747
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3106168
بازگشت