摘要
对图G(V,E),μ(G)称为G的Mycielski图,V(μ(G))=V(G)∪{v′｜v∈V(G)}∪{w},且w V(G),而E(μ(G))=E(G)∪{uv′｜u∈V(G),v′∈V′,且uv∈E(G)}∪{wv′｜v′∈V′}.其中,w V(G),V′={v′｜v∈V(G)}.本文得到了路、圈、扇、轮、星、完全图的Mycielski图的临强边色数.
It is μ(G) called Mycielski Graph G, if V(μ(G))=V(G)∪{v′|V∈V(G)}∪{w} and wV(G) and E(μ(G))=E(G)∪{uv′|u∈V(G),v′∈V′,且uv∈E(G)}∪{wv′|v′∈V′}其中wV(G),V′={v′|v∈V(G)}. In this paper, we have proved the adjacent strong edge chromatic number of Mycielski graph of some graphs such as path, cycle, fan, wheel, star and complete graph.
出处
《兰州铁道学院学报》
2003年第3期4-7,共4页
Journal of Lanzhou Railway University
基金
国家自然科学基金资助项目(No.19871036).
