摘要
图G(V,E)的Smarandachely邻点边色数是满足条件uv∈E(G),|C(u)\C(v)|≥1并且|C(v)\C(u)|≥1的一个正常边染色的最小边色数,其中C(u)={f(uv)|uv∈E(G)}。给出了路、圈、星、扇图的倍图的Smaran-dachely邻点边色数。
The Smarandachely-adjacent-vertex edge chromatic number of graph G is the smallest k for which G has a proper edge k-coloring.For any pair of adjacent vertices,the set of colors appearing at either vertex s incident edges is not a subset of the set of colors appearing at the other vertex s incident edges.The smarandachely adjacent vertex edge chromatic number of some double graphs are obtained.
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2009年第12期25-29,共5页
Journal of Shandong University(Natural Science)
基金
国家自然科学基金资助项目(10771091)
兰州交通大学学生科研创新立项(DXS2008-0281114)
陕西省自然科学基础研究计划资助项目(SJ08A20)
