摘要
简单图G(V,E)的Smarandachely邻点全染色是G的正常全染色,满足对图G(V,E)的任意两个相邻点u和v有|C(u)\C(V)|≥1且|C(v)\C(u)|≥1,其所用最小色数称为图G的Smarandachely邻点全色数,其中:C(u)={f(u)}∪{f(uv)|uv∈E(G)}.给出了广义拟Thomassen图的Smarandachely邻点全色数.
Smarandachely adjacent vertex total chromatic number of graph G(V,E) is the smallest number of total colors assignable to V and E,so that any two adjacent vertices u and v satisfying:|C(u)/C(V)|≥1 and |C(v)/C(u)|≥1,where C(u)={f(u)}∪{f(uv)|uv∈E(G)}.In this paper,we obtain the Smarandachely adjacent-vertex total chromatic number of generalized imitative Thomassen graph.
出处
《兰州交通大学学报》
CAS
2010年第4期147-149,共3页
Journal of Lanzhou Jiaotong University
基金
国家自然科学基金(10771091)