期刊文献+

一类优美图

A class of graceful graphs
下载PDF
导出
摘要 对P2r,2m的优美性进行探讨.采用函数构造法证明了r=13时P2r,2m是优美的. This paper discusses the graceful graph of P2r,2m.Using the structure method,P2r,2m is proved to be graceful for r=13.
作者 张红霞
出处 《南阳师范学院学报》 CAS 2011年第9期20-23,共4页 Journal of Nanyang Normal University
关键词 优美图 顶点标号 边标号 graceful graph vertex labeling edge labeling
  • 相关文献

参考文献4

  • 1Kathiresan K M. Two class of graceful graphs [ J ]. Ars Combinatorial,2000,22:491 -504.
  • 2杨元生,容青,徐喜荣.一类优美图[J].Journal of Mathematical Research and Exposition,2004,24(3):520-524. 被引量:14
  • 3容青,杨元生.一类优美图[J].广西师范学院学报(自然科学版),2002,19(3):1-4. 被引量:3
  • 4张红霞.两类优美图[D].太原:山西大学,2008.

二级参考文献12

  • 1RINGEL G. Problem 25 in theory of graphs and its application [J]. Proc. Symposium Smolenice,1963, 162.
  • 2ROSA A. On certain Valuations of the Vertices of a Graph [M]. Theory of Graphs, Proc. Internat,Sympos, Rome. , 1966, 349-355.
  • 3GOLOMB S W. How to Number a Graph [M]. Graph Theory and Computing, Academic Press, New York, 1972, 23-37.
  • 4GALLIAN J A. A dynamic survery of graph labeling [J]. The electronic journal of combinatorics,2000, 6.
  • 5KATHIESAN K M. Two classes of graceful graphs [J]. Ars Combinatoria, 2000, 55.. 129-132.
  • 6Ringel G. Problem 25 in theory of graphs and its application[J]. Proc Symposium Smolenice, 1963,162.
  • 7Rosa A. On certain valuations of the vertices of a graph,Theory of Graphs. Proc Internat,Sympos,Rome, 1966.349-355.
  • 8Golomb S W. How to number a graph,Graph theory and computing[M]. New York:Academic Prees, 1972.23-37.
  • 9Gallian J A. A dynamic survery of graph labeling[J]. The electronic journal of combinatorics,2000, (6).
  • 10Kathiesan K M. Two classes of graceful graphs[J]. ARS combinatoria,2000, (22):491-504.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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