期刊文献+

自然数列对虾树及其串联树的强优美性

Strongly Gracefulness of Natural Number Sequence Lobster and Its Series Tree
原文传递
导出
摘要 具有完美匹配M的n阶树T是强优美的,如果对任意的uv∈M,存在树T的一个优美标f,使得f(u)+f(v)=n-1.讨论了自然数列对虾树及其串联树的强优美标号. Let T be a tree with n vertices and a perfect matching M. T is strongly graceful if it admits a graceful labeling f such that f(u) + f(v) = n - 1 for every edge uv ∈ M. In this paper, strongly graceful labeling of natural number sequence lobster and its series tree are discussed.
出处 《数学的实践与认识》 CSCD 北大核心 2013年第24期192-197,共6页 Mathematics in Practice and Theory
基金 国家自然科学基金(61163037 61163054 11261016) 宁夏回族自治区百人计划资助项目
关键词 自然数列对虾树 优美标号 强优美标号 串联树 natural number sequence lobster graceful labeling strongly graceful labeling series tree
  • 相关文献

参考文献5

  • 1Bondy J. A. and Murty U. S. R. Graph Theory[M]. Springer, London, 2008.
  • 2Cheng Hui, Yao Bing, Chen Xiang'en and Zhang Zhongfu. On graceful generalized spiders and caterpillars[J]. Ars Combinatoria, 2008, 87(2): 181-191.
  • 3Yao Bing, Cheng Hui, Yao Ming and Zhao Meimei. A note on strongly graceful trees [J]. Ars Combinatoria, 2009, 92: 155-169.
  • 4Bela. Bollobds. The Modern Graph Theory[M]. Springer-Verlag, New York, 1998.
  • 5Bonnington P C, and Sirdn J. Bipartite labeling of trees with maximum degree three[J]. J Graph Theory, 1999, 31(1): 7-15.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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