journal6 ›› 2014, Vol. 35 ›› Issue (2): 6-9.DOI: 10.3969/j.issn.1007-2985.2014.02.003

• Mathematics • Previous Articles     Next Articles

Super-Edge-Graceful Labelings of Two Kinds of GraphsAssociated with the Fan Graph

 JIA  Hui-Xian, ZUO  Da-Wei   

  1. (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)
  • Online:2014-03-25 Published:2014-05-09

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.

Key words: super edge-graceful, fan graph Fn+1, graph K1×, 2Pn, decomposition of graph, labeling of spoke, labeling of path

WeChat e-book chaoxing Mobile QQ