k-优美图与优美图G_(k-1)的优美性研究  

On Gracefulness of k-Graceful Graph and G_(k-1)-Co-Graphs

作　　者：于艳华[1] 王文祥[1] 张昆龙[1] 

机构地区：[1]华北科技学院基础部,河北三河065201

出　　处：《西南师范大学学报（自然科学版）》2012年第5期1-5,共5页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(19801016;10261003)

摘　　要：对k-优美图n,Km,n与任意一个有k-1条边的优美图Gk-1的优美关系进行了研究.证明了:当n为奇数时,图n∪Gk-1是优美图;当n为偶数时,粘接图〈n,Gk-1〉是优美图.还证明了粘接图〈Km,n,Gk-1〉是优美图.A study has been done in this thesis on the gracefulness of k-graceful graph Wn ,Kinm,n, and a randomly chosen graceful graph Gk-1 with any k-1 sides. The study proves that Wn∪Gk-1 is a graeful graph when n is an odd numberl and that adhesive figure （Wn Gk-1 ） is a graceful graph when n is an even number. This study also demonstrates that （K Gk-1 ） is graceful.

关 键 词：图 优美图 优美标号 非连通图 

分 类 号：O157.6[理学—数学]