摘要
对图G(V ,E) ,μ(G)称为G的Mycielski图 ,V( μ(G) ) =V(G)∪ {v′｜v∈V(G) }∪ {w} E( μ(G) ) =E(G)∪ {uv′｜u∈V(G) ,v′∈V′且uv∈E(G) }∪ {wv′｜v′∈V′}其中w V(G) ,V′={v′｜v∈V(G) } .本文得到了路、圈、扇、轮、星。
It is μ(G) called Mycrelski Graph G,V(μ(G))=V(G)∪V′∪｛w｝and wV(G) and E(μ(G))=E(G)∪｛uv′｜u∈V(G),v′∈V′,uv∈E(G)｝∪｛wv′｜v′∈V′｝ where wV(G),V′=｛v′｜v∈V(G)｝ In this paper,we can see that the total chromatic number of Mycirelski graph of some graphs such as path,cycle,fan,wheel,star, complete graph and etc. have been proved.
出处
《兰州铁道学院学报》
2003年第4期1-4,共4页
Journal of Lanzhou Railway University
基金
国家自然科学基金资助项目 ( 1 9871 0 36 )
