期刊文献+

一类优美图P_(2r,2m)(r=8,10,11)的优美性

The gracefulness of a class of graceful graph P_(2r,2m)(r=8,10,11)
下载PDF
导出
摘要 用函数构造法证实r=8,10,11时,P2r,2m是优美图。 According to construction method of functions,this paper proves that P2r,2mis graceful graph at the time of r=8,10,11.
作者 张红霞
出处 《长春工程学院学报(自然科学版)》 2011年第3期141-144,共4页 Journal of Changchun Institute of Technology:Natural Sciences Edition
关键词 优美图 顶点标号 边标号 graceful graph vertex labeling edge labeling
  • 相关文献

参考文献5

二级参考文献19

  • 1杨元生,容青,徐喜荣.一类优美图[J].Journal of Mathematical Research and Exposition,2004,24(3):520-524. 被引量:14
  • 2RINGEL G. Problem 25 in theory of graphs and its application [J]. Proc. Symposium Smolenice,1963, 162.
  • 3ROSA A. On certain Valuations of the Vertices of a Graph [M]. Theory of Graphs, Proc. Internat,Sympos, Rome. , 1966, 349-355.
  • 4GOLOMB S W. How to Number a Graph [M]. Graph Theory and Computing, Academic Press, New York, 1972, 23-37.
  • 5GALLIAN J A. A dynamic survery of graph labeling [J]. The electronic journal of combinatorics,2000, 6.
  • 6KATHIESAN K M. Two classes of graceful graphs [J]. Ars Combinatoria, 2000, 55.. 129-132.
  • 7Ringel G. Problem 25 in theory of graphs and its application[J]. Proc Symposium Smolenice, 1963,162.
  • 8Rosa A. On certain valuations of the vertices of a graph,Theory of Graphs. Proc Internat,Sympos,Rome, 1966.349-355.
  • 9Golomb S W. How to number a graph,Graph theory and computing[M]. New York:Academic Prees, 1972.23-37.
  • 10Gallian J A. A dynamic survery of graph labeling[J]. The electronic journal of combinatorics,2000, (6).

共引文献32

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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