首页 | 本学科首页   官方微博 | 高级检索  
     检索      

轮图与舵轮图的超边优美标号
引用本文:贾慧羡,左大伟.轮图与舵轮图的超边优美标号[J].石家庄铁道学院学报,2014(2):105-110.
作者姓名:贾慧羡  左大伟
作者单位:[1]石家庄邮电职业技术学院基础部,河北石家庄050021 [2]石家庄铁道大学数理系,河北石家庄050043
基金项目:河北省教育厅资助科研项目(Z2013057)
摘    要:1994年, Mitchem和Simoson在研究标号图的问题时,提出了超边优美图的概念。在随后的研究中,一些图被证明具有超边优美性质,同时关于超边优美图的一些猜想也被提出。本文利用递归方法构造了轮图Wn与舵轮图Hn的超边优美标号,证明了这两类图是超边优美图。

关 键 词:轮图  舵轮图  超边优美标号

Super-edge-graceful Labelings of Wheel Graphs and Helms Graphs
Jia Huixian,Zuo Dawei.Super-edge-graceful Labelings of Wheel Graphs and Helms Graphs[J].Journal of Shijiazhuang Railway Institute,2014(2):105-110.
Authors:Jia Huixian  Zuo Dawei
Institution:1. Department of basic, Shijiazhuang Post and Telecommunication Technical College, Shijiazhuang 050021, China; 2. Department of Mathematics and Physics, Shijiazhuang Tiedao University, Shijiazhuang 050043, China)
Abstract:In 1994, Mitchem and Simoson introduced the notion of super edge-graceful graphs when they studied the problem of the labeling graph .In the course of subsequent studies , it is proven that some graphs are super edge-graceful and some conjections on super edge-graceful graphs are introduced .In this paper the super edge-graceful labelings of the wheel graphs Wn and helms graphs Hn are constructed by recursion ,and it is proven that they are super edge-graceful graphs .
Keywords:wheel graph  helms graph  super edge-graceful
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号