期刊文献+

最大边数的Cordial图的构造 被引量:3

The Construction of Cordial Graph with Maximun Number of Edges
下载PDF
导出
摘要 对于n阶Cordial图G,本文给出G的边数的上确界e*,并给出边数达到e*的Cordial图的构造. For a Cordial graph with order n, we determine the sharp upper bound of their number of edges, the extremal graph is also constructed.
作者 刘群 刘峙山
出处 《数学研究》 CSCD 2003年第4期437-439,共3页 Journal of Mathematical Study
关键词 CORDIAL图 边数上确界 极图 Cordial graph upper bound extremal graph
  • 相关文献

参考文献4

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

同被引文献12

  • 1刘峙山,堵根民.三正则连通图的Cordial性[J].数学研究,2007,40(1):114-116. 被引量:5
  • 2倪臣敏,刘峙山,陈丽娜.关于一点联的Cordial性的一个结果的推广[J].延边大学学报(自然科学版),2007,33(2):94-97. 被引量:2
  • 3Gallian J A.A Dynamic Survey of Graph Labellings of Graphs[J].Electronic Journal of Combinatorics,2005(5):DS6. 被引量:1
  • 4Cahit I.Cordial Graphs:A Weaker Version of Graceful and Harmonious Graphs[J].Ars Combinatoria,1987,23:201-208. 被引量:1
  • 5Cahit I.On Cordial and 3-equitable Labellings of Graphs[J].Utilitas Math,1990,37:189-198. 被引量:1
  • 6[1]Cahit I.Cordial Graph:A Weak Version of Graceful and Harmonious Graphs[J].Ars Combinatoric,1987,23:201-208. 被引量:1
  • 7[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
  • 8[3]Gallian J A.A Dynamic Survey of Graph Labeling[J].Electronic Journal of Combinatorics,2005,5(DS6). 被引量:1
  • 9[4]Cahit I.On Cordial and 3-equitable Labellings of Graphs[J].Utilitas Math,1990,37:189-198. 被引量:1
  • 10[5]Kirchherr W W.On the Cordiality of Some Speci_c Graphs[J].Ars Combinatoric,1991,31:127-138. 被引量:1

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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