期刊文献+

关于一点联的Cordial性的一个结果的推广 被引量:2

A Promoted Result on the Cordiality of the One-point Union
下载PDF
导出
摘要 将文献[2](Shee S C,Ho Y S.The Cordiality of One-point Union of n-copies of a Graph.Discrete Math,1993,117:225-243)的结果推广到一般的圈的一点联,即粘连的圈的个数是任意的且每个圈的顶点数也是任意的情况,并给出了此类一点联的Cordial性的分析证明. A promoted result of [2](Shee S C, Ho Y S. The Cordiality of One-point Union of n-copies of a Graph. Discrete Math, 1993,117:225-243) on the cordiality of the one-point union is presented, i.e. the number of the cycles and the number of the vertices on each cycle are arbitrary. An analytical proof on its cordiality is proposed.
机构地区 仰恩大学数学系
出处 《延边大学学报(自然科学版)》 CAS 2007年第2期94-97,共4页 Journal of Yanbian University(Natural Science Edition)
关键词 CORDIAL图 一点联 cordial graph cycle one-point union
  • 相关文献

参考文献7

  • 1[1]Cahit I.Cordial Graph:A Weak Version of Graceful and Harmonious Graphs[J].Ars Combinatoric,1987,23:201-208.
  • 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.
  • 3[3]Gallian J A.A Dynamic Survey of Graph Labeling[J].Electronic Journal of Combinatorics,2005,5(DS6).
  • 4[4]Cahit I.On Cordial and 3-equitable Labellings of Graphs[J].Utilitas Math,1990,37:189-198.
  • 5[5]Kirchherr W W.On the Cordiality of Some Speci_c Graphs[J].Ars Combinatoric,1991,31:127-138.
  • 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.
  • 7刘群,刘峙山.最大边数的Cordial图的构造[J].数学研究,2003,36(4):437-439. 被引量:3

二级参考文献4

  • 1[1]Cahit R. Cordial graphs: A weaker version of graceful and harmonious graphs. Ars Combinatorica, 1987, 23:201-208.
  • 2[2]Cahit R, Yilmaz R. E1-Cordial graphs. Ars Combinatorica, 2000, 54:119-127.
  • 3[3]Cahit R, Yilmaz. E-Cordial graphs. Ars Combinatorica, 1997, 46:251-266.
  • 4[4]Cahit R. H-Cordial graphs. Bull Inst. Combinatorica Appl. 1996, 18:87-101.

共引文献2

同被引文献10

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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