期刊文献+

优美图所有优美标号的生成算法 被引量:6

Generating algorithm for all graceful labeling of graceful graph
下载PDF
导出
摘要 给出了由n条边生成的所有优美图的所有优美标号的生成算法,并把代数理论和计算机工具引入了优美图的研究.利用该算法,可以根据需要得到优美图及其优美标号. The generating algorithm for all the graceful labeling of all the graceful graphs generated with nedges is developed.Moreover,the graceful graph is studied by the tools such as algebraic theory and computers.The grace-ful graph and its graceful labeling according to some special conditions can be made using the algorithm.
作者 唐保祥 任韩
出处 《天津师范大学学报(自然科学版)》 CAS 北大核心 2010年第4期5-8,共4页 Journal of Tianjin Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(10671073) 上海市自然科学基金资助项目(07XD14011) 上海市重点学科建设基金资助项目(B407)
关键词 优美图 优美标号 优美排列 极大优美图 极小优美图 graceful graph graceful labeling graceful permutation maximal graceful graph minimal graceful graph
  • 相关文献

参考文献6

二级参考文献14

  • 1唐保祥.一类包含优美树的优美图[J].上海师范大学学报(自然科学版),1998,27(2):18-20. 被引量:3
  • 2魏丽侠,贾治中.非连通图G_1uG_2及G_1uG_2uK_2的优美性[J].应用数学学报,2005,28(4):689-694. 被引量:26
  • 3严谦泰.图P_(2r,2m)的优美标号[J].系统科学与数学,2006,26(5):513-517. 被引量:23
  • 4BONDY J A 等 吴望名等(译).图论及其应用[M].北京:科学出版社,1984..
  • 5RINGEL G. Problem 25 in theory of graphs and its application [J]. Proc. Symposium Smolenice,1963, 162.
  • 6ROSA A. On certain Valuations of the Vertices of a Graph [M]. Theory of Graphs, Proc. Internat,Sympos, Rome. , 1966, 349-355.
  • 7GOLOMB S W. How to Number a Graph [M]. Graph Theory and Computing, Academic Press, New York, 1972, 23-37.
  • 8GALLIAN J A. A dynamic survery of graph labeling [J]. The electronic journal of combinatorics,2000, 6.
  • 9KATHIESAN K M. Two classes of graceful graphs [J]. Ars Combinatoria, 2000, 55.. 129-132.
  • 10BONDY D A, MURTY U S R.图论及其应用[M].吴望名,李念祖,吴兰芳,等译.北京:科学出版社,1984.

共引文献44

同被引文献28

  • 1魏丽侠,贾治中.非连通图G_1uG_2及G_1uG_2uK_2的优美性[J].应用数学学报,2005,28(4):689-694. 被引量:26
  • 2严谦泰.图P_(2r,2m)的优美标号[J].系统科学与数学,2006,26(5):513-517. 被引量:23
  • 3唐保祥.优美图的嵌入[J].上海师范大学学报(自然科学版),2007,36(2):24-27. 被引量:3
  • 4Bondy J A,Murty U S R.Graph Theory with Applications[M].New York:Macmilan Ltd Press,1976.
  • 5Wei L X,Yan S F,Zhang K L.The researches on gracefuness of two kinds of unconnected graphs[J].Journal of Shandong University(Natural Science),2008,43(8):90-96(Ch).
  • 6Rosa A.On certain valuations of the vertices of a graph[C]//Theory of Graphs,(International Symposium,Rome,July 1966).New York:Gordon and Breach,1967:349-355.
  • 7Gnanajothi R B.Topics in graph theoryp].Ph D Thesis Madurai:Madurai Kamaraj University,1991.
  • 8Gallian J A.A dynamic survey of graph labeling[J].The Electronic Journal of Combinatorics,2007,14:1-18.
  • 9Barrientos C.Odd-graceful Labelings[M].Preprint,2009.
  • 10Zhou X,Yao B,Chen X,et al.A Proof to the Odd-gracefulness of All Lobsters[J].Ars Combin,2012,21(3):13-18.

引证文献6

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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