期刊文献+

C_m×C_n的k-边优美的图标号 被引量:5

On Edge-graceful Indices of C_m×C_n
下载PDF
导出
摘要 首先给出了图G=V,E为k-边优美的充分条件,根据正则图的特殊性质,讨论了Cm×Cn为k-边优美图的必要条件.利用递归方法构造k-边优美图标号并给出详细证明,从而完全解决了Cm×Cn的边优美指标集问题. The sufficient condition is given out which G = (V, E) is said to be k-edge-graceful graph. And by the especial property of regular graph, the necessary condition which the graph Cm×Cn is k-edge-graceful is discussed. A method to construct k-edge-graceful graph Cm×Cn is given out by recursion and the problem of what sets of natural numbers are the edge-graceful indices of graph Cm×Cn is completely dissolved.
出处 《江汉大学学报(自然科学版)》 2006年第3期16-18,共3页 Journal of Jianghan University:Natural Science Edition
关键词 k-边优美图 边优美指标集 Cm×Cn图 k-edge-graceful edge-graceful indices Cm×Cn graph
  • 相关文献

参考文献6

  • 1Lee S M,Seah E,Lo S P.On edge-graceful 2-regular graphs[J].The Journal of Combinatoric Mathematics and Combinatoric Computing,1992,12:109-117.
  • 2Lee S M,Murty G.On edge-graceful labelings of complete graphs-solutions of Lo's conjecture[J].Congressum Numerantum,1998,62:225-233.
  • 3Lee S M.New directions in the theory of edge-graceful graphs[J].Proc 6th Caribbean Conf Combin Computing,1991,5:216-231.
  • 4Lee S M.A conjecture on edge-graceful trees[J].Scientia,1989,3:45-47.
  • 5Gallian J A.A dynamic survey of graph labeling[J].The Electronic J of Combinatorics,2001,6:DS6.
  • 6Schaffer K,Lee S M.Edge-graceful and edge-magic labeling of cartesian products of graphs[J].Congress Number,1999,141:119-134.

同被引文献13

  • 1温一慧.关于弱边优美图的存在性[J].兰州大学学报(自然科学版),2005,41(5):131-133. 被引量:3
  • 2Lo S. On edge-graceful labelings of graphs[J]. Congr. Number. , 1985,50 : 231-241.
  • 3Lee SM. New directions in the theory of edge-graceful graphs [J]. Proc. 6th Caribbean Conf. Combin. Computing, 1991(3): 216-231.
  • 4Daniel liang Y. Introduction to Java programming-comprehensive version[M]. New Jersey:6th Edition Prentice Hall,2008.
  • 5Lo S P. On edge-graceful labeling of graphs[J]. Congressus Numerantium, 1985(50) :231-241.
  • 6Lee L M, Lee S M, Murthy G. On edge-graceful labelings of complete graphs solutions of Lo's eonjeeture[J]. Congressum Numeran- rum,1988(62) :225-233.
  • 7I.ee S M, Seah E. On the edge-graceful (n, kn)-multigraphs conjecture[J]. Journal of Combinatorial Mathematics and Combinatorial Computing, 1991 (9) : 141-147.
  • 8Lee S M, Seah E, Lo S P. On edge-graceful 2-regular graphs[J]. Journal of Combinatoric Mathematics and Combinatoric Computing, 1992(12):109-117.
  • 9Lee S M. A conjecture on edge-graceful trees[J]. Scientia, 1989,3:45-47.
  • 10Gallian J A. A dynamic survey of graph labeling[J]. The Electronic Journal of Combinatories,2011(18) :1-79.

引证文献5

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部