期刊文献+

关于一些图的T_n-union的Cordial性 被引量:1

The Cordiality of the T_n-union of Some Graphs
下载PDF
导出
摘要 将文献[5](Shee S C,Ho YS.The Cordiality of the Path-union ofnCopies of a Graph.Discrete Math,1996,151:221-229.)的结果推广到Tn-union的情形,且不要求每个节点的图形必须相同.并给出了任意圈和扇Tn-union的Cordial性的分析和证明. The result of [5] is promoted to the situation of T,,-union without requiring all the graphs on the node be the same. A analytical proof is proposed on the cordiality of Tn-union of some graphs.
机构地区 仰恩大学数学系
出处 《延边大学学报(自然科学版)》 CAS 2009年第4期312-314,共3页 Journal of Yanbian University(Natural Science Edition)
关键词 CORDIAL图 Tn-union Cordial graph Tn-union cycle fan
  • 相关文献

参考文献8

二级参考文献16

  • 1[1]Cahit I.Cordial Graph:A Weak Version of Graceful and Harmonious Graphs[J].Ars Combinatoric,1987,23:201-208. 被引量:1
  • 2[2]Shee S C,Ho Y S.The Cordiality of One-point Union of n-copies of a Graph[J].Discrete Math,1993,117:225-243. 被引量:1
  • 3[3]Gallian J A.A Dynamic Survey of Graph Labeling[J].Electronic Journal of Combinatorics,2005,5(DS6). 被引量:1
  • 4[4]Cahit I.On Cordial and 3-equitable Labellings of Graphs[J].Utilitas Math,1990,37:189-198. 被引量:1
  • 5[5]Kirchherr W W.On the Cordiality of Some Speci_c Graphs[J].Ars Combinatoric,1991,31:127-138. 被引量:1
  • 6[6]Ho Y S,Lee S M,Shee S C.Cordial Labellings of the Cartesian Product and Composition of Graphs[J].Ars Combinatoric,1990,29:169-180. 被引量:1
  • 7Cahit R. Cordial graphs: A weaker version of graceful and harmonious graphs [J]. Ars ombinatorica, 1987,23 : 201 - 208. 被引量:1
  • 8Joseph A Gallian. A Dynamic Survey of Graph Labeling[J]. The Electronic Journal of Combinatorics,2005(5) :41-46. 被引量:1
  • 9Bondy J A,Murty U S R. Graph Theory with Applications [M]. New York: North Holland,1976. 被引量:1
  • 10Bondy J and Murty U S. Graph Theory with Applications. North-Holland, Nework, 1976. 被引量:1

共引文献8

同被引文献7

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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