欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
对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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：