期刊文献+

三正则连通图的Cordial性 被引量:5

On Cordiality of the Connected 3-Regular Graphs
下载PDF
导出
摘要 用调整顶点标号的方法确定了3正则连通图的Cordial性. In this paper, we give a method by changing labels to determine the cordiality of the connected 3-regular graphs.
出处 《数学研究》 CSCD 2007年第1期114-116,共3页 Journal of Mathematical Study
关键词 CORDIAL图 3正则连通图 Cordial graph connected 3-regular graph
  • 相关文献

参考文献5

  • 1Bondy J A, Murty U S R. Graph Theory with Applications. North Holland, New York, 1976.
  • 2Cahit R. Cordial graphs: A weaker version of graceful and harmonious graphs. Ars Combinatorica, 1987,23 : 201-- 208.
  • 3Kuo S, Chang G J. Cordial labeling of mk--n. Discrete Math. 1997, 169:1--3.
  • 4Limaye N B. Cordial Labelings of Some Wheel Related Graphs. JCMCC, 2002, 41.
  • 5Andar M M. On the cordiality of corona Graphs. Ars Combinatoria, 2006, 78.

同被引文献19

  • 1倪臣敏,刘峙山,陈丽娜.关于一点联的Cordial性的一个结果的推广[J].延边大学学报(自然科学版),2007,33(2):94-97. 被引量:2
  • 2Ringel. G. , Problem 25, in : Theory d Graphs and Its Applica- tions[C]. Proc Symposium Smo- lenice Prague,1963: 162- 167 .
  • 3Rosa. A. On Certain Valuations of the Vertices of a Graph [ C ]. Theory of Graphs, 1966, (7) : 349 - 355.
  • 4G. S. Bloom and S.W. Golomb, Numbered Complete Graphs, Unusual Rulers,and Assorted Applicatlons,Theory and Applica- tions of Graphs[ M ]. Springer - Vedag, NewYork, 1978, (642) : 53 -65.
  • 5M. Sutton, Summable Graphs Labelinss and their Applications. ( Ph.D. Thesis) [D]. Dcpt. Computer Science,The University of Newcastle ,2001.
  • 6Joseph A. Gallian, A Dynamic Survey of Graph Labeling,the E- lectronic Journal of Combinatorics [ J ]. 2012, ( 19 ) : 51 - 58.
  • 7Cahit I. Cordial graph : A Weak Version of Graceful and Harmoni- ous Graphs,Ars Combin[J]. 1987 ,(23) :201-207.
  • 8M. A. Seoud and A. E. I. Abdd Maqsoud, On Cordial and Bal- anced Labelings of Graphs[J]. Egyptian Math. Soc, 1999,(7) : 27 - 135.
  • 9Ni Chenmin, Liu Zhishan, On the Cordiality of Graphs, Ars Combin [ J]. 2014, ( 113 ) : 451 - 455.
  • 10Liu Zhishan, Zhu Biwen, A Necessary and Sufilciont Condition for A 3 -Regular Graph to be Cordial. Ars Combin[ J]. 2007, (84) : 225 - 230.

引证文献5

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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