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

与扇图相关的2类图的超边优美标号
引用本文:贾慧羡,左大伟. 与扇图相关的2类图的超边优美标号[J]. 吉首大学学报(自然科学版), 2014, 35(2): 6-9. DOI: 10.3969/j.issn.1007-2985.2014.02.003
作者姓名:贾慧羡  左大伟
作者单位:(1.石家庄邮电职业技术学院基础部,河北 石家庄 050021;2.石家庄铁道大学数理系,河北 石家庄 050043)
基金项目:河北省教育厅科学研究项目(Z2013057)
摘    要:利用递归方法构造了扇图和图K1×2Pn的超边优美标号,证明了这2类图是超边优美图.

关 键 词:超边优美  扇图Fn+1  K1×  2Pn  图分解  轮辐标号  路标号  

Super-Edge-Graceful Labelings of Two Kinds of GraphsAssociated with the Fan Graph
JIA Hui-Xian,ZUO Da-Wei. Super-Edge-Graceful Labelings of Two Kinds of GraphsAssociated with the Fan Graph[J]. Journal of Jishou University(Natural Science Edition), 2014, 35(2): 6-9. DOI: 10.3969/j.issn.1007-2985.2014.02.003
Authors:JIA Hui-Xian  ZUO Da-Wei
Affiliation:(1.Department of Basic Sciences,Shijiazhuang Post and Telecommunication Technical College,Shijiazhuang 050021,China;2.Department of Mathematics and Physics,Shijiazhuang Tiedao University,Shijazhuang 050043,China)
Abstract:The super edge-graceful labelings of the fan graphs Fn+1 and the graphs K1×2Pn are constructed by recursion,and it is proven that they are super edge-graceful graphs.
Keywords:super edge-graceful  Fn+1')"   href="  #"  >fan graph Fn+1  1×')"   href="  #"  >graph K1×  n')"   href="  #"  >2Pn  decomposition of graph  labeling of spoke  labeling of path
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《吉首大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《吉首大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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