期刊文献+

图P_n∪P_m的优美性初探 被引量:4

A Preliminary Research on the Gracefulness of Graphs P_n∪ P_m
在线阅读 下载PDF
导出
摘要 首次提出了图P_nUP_m的优美性问题,并且证明了P_nUP_m,n>2;P_nUP_(n+1);P_nUP_(n+3);以及P_2UP_n,n>2的优美性。 In this paper, we pose a problem of the gracefulness of graphs Pn∪Pm, and prove the gracefulness of Pn∪Pm, where n>2; Pn∪Pn+1; Pn∪Pn+2, and P2∪Pn, where n>2.
出处 《北京工业大学学报》 CAS CSCD 1993年第4期15-26,共12页 Journal of Beijing University of Technology
关键词 优美图 标号 并图 图论 graceful graph, lable, path
  • 相关文献

同被引文献16

  • 1杨燕昌,王广选.一些图P_n∪P_m的优美性[J].广西大学学报(自然科学版),1993,18(2):87-94. 被引量:5
  • 2马杰克.优美图[M].北京:北京大学出版社,1991.
  • 3Gallian I A. A dynamic survey of graph labeliag[J]. The E J of Combinatorics,2001,12.
  • 4Frucht R W, Salinas L C. Graceful numbering of snakes with constains on the first label[J]. Ars Combinat, 1985,20 : 143-157.
  • 5Deshmukh U N. Gracefulness of same union graphs[D].Indai,Bombay:University of Bombay, 1995.
  • 6Choudum S A, Pitchai Muthu Kishore S. Graceful labelling of the union of paths and cycles[J].Discrete Mathematics, 1999,206(1-3) :105-117.
  • 7Bondy J A, Murty U S R. Graph Theory with Appllcation[M]. London: the MachiUan Press,1976.
  • 8Gallian J A.A dynamic survey of graph labeling[J].The E J of Combinatorics,2001,12.
  • 9KOH K M,ROGERS D G,TAN T.A graceful arboretum:a survey of graceful trees[M].Singapore Southeast Bull Math,1979:278-287.
  • 10HARARY F.Sum graphs and difference graphs[J].Cong Number,1990,72:101-108.

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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