期刊文献+

一类优美图的计算机算法 被引量:9

A Computer Algorithm of a Class of Graceful Graphs
在线阅读 下载PDF
导出
摘要 探索和研究了一类新的优美图的优美标号问题,建立了相应的优美标号数学模型,通过计算机编程,运用算法设计与分析的思想,设计了这类图的优美标号的计算机求解算法和相应的优美标号,并给出了严格的数学证明,从而得出这类图都是优美图等结论. The graceful labeling of a new class of graceful graphs is explored and studied. The corresponding mathematical model of the graceful labeling is established by the computer programming with the idea of computer algorithm design and analysis. Finally,the graceful labeling of this kind graph computer solving algorithm and all the graceful labeling are designed. The conclusion of the gracefulness of this graphs and its proof are given.
作者 刘家保 王林
机构地区 安徽新华学院
出处 《汕头大学学报(自然科学版)》 2011年第2期23-28,共6页 Journal of Shantou University:Natural Science Edition
基金 安徽省高等学校省级自然科学基金项目(No:KJ2010B076)
关键词 优美标号 优美图 数学模型 graceful labeling graceful graphs mathematical model
  • 相关文献

参考文献9

二级参考文献38

  • 1潘伟,路线.图K_2∧K_(m,n)的优美性[J].吉林大学学报(理学版),2004,42(3):365-366. 被引量:6
  • 2杨元生,容青,徐喜荣.一类优美图[J].Journal of Mathematical Research and Exposition,2004,24(3):520-524. 被引量:14
  • 3郭文富.关于图B(m,n,p)的优美性[J].数学杂志,1995,15(3):345-351. 被引量:3
  • 4严谦泰.图P_(2r,2m)的优美标号[J].系统科学与数学,2006,26(5):513-517. 被引量:23
  • 5林育青.C_n与1C_n的优美标号[J].安徽大学学报(自然科学版),2007,31(2):13-16. 被引量:17
  • 6Ringel G. Problem 25 in theory of graphs and its application[C]. Smolenice : Proc. Symposium Smolenice, 1963: 162-167.
  • 7Rosa A. On certain valuations of the vertices of a graph, theory of graphs[C]. Rome: Proc. Internat, Sympos, 1966: 349-355.
  • 8Golomb S W. How to number a graph, graph theory and computing[M]. New York: Academic Press, 1972: 23-37.
  • 9Mishra D, Panigrahi P. Some graceful lobsters with all three types of branches incident on the vertices of the central path[J]. Computers & Mathematics with Applications, 2008, 56(5): 1382-1394.
  • 10Gallian A. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, 2000, 12: 1-95.

共引文献55

同被引文献36

  • 1唐保祥.几类优美图[J].天水师范学院学报,2008,28(5):1-3. 被引量:2
  • 2杨显文.关于C_(4m)蛇的优美性[J].工程数学学报,1995,12(4):110-112. 被引量:55
  • 3郭文富.关于图B(m,n,p)的优美性[J].数学杂志,1995,15(3):345-351. 被引量:3
  • 4严谦泰.图P_(2r,2m)的优美标号[J].系统科学与数学,2006,26(5):513-517. 被引量:23
  • 5Exoo G, Ling A, Mcsorley J, et al. Totally magic graphs[J]. Discrete Math, 2002, 254: 103-113.
  • 6Enomoto H, Llado A S, Nakamigawa T, et al. Super edge-magic graphs[J]. SUT J Math, 1998, 34: 105-109.
  • 7杨元生,奚悦,徐喜荣.Super edge-magic labelings of book graphs B-n[J]. Ars Combinatoria,2009, 93: 431-438.
  • 8徐喜荣,杨元生,奚悦.Super edge-magic labelings of generalized Petersen graphs P(n ,3 )[J]. Ars Combinatoria, 2007, 85: 19-31.
  • 9Figueroa R, Ichishima R, Muntaner F. On super edge-magic graphs[J]. Ars Combin, 2002, 64: 81-95.
  • 10Rosa A. On certain valuations of the vertices of a graph [C]//Theory of Graphs (Int Symposium, Rome, July 1966), Gordon and Breach, N Y and Dunod Paris, 1967: 349-355.

引证文献9

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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