摘要
具有完美匹配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