摘要
具有完美匹配M的n阶树T是强优美的,如果对任意uv∈M,存在树T的一个优美标号f,使得f(u)+f(u)=n-1.给出了二分奇优美树和强优美树的概念,证明了斐波纳契对虾树是二分奇优美和强优美树.
A tree T having n vertices and a perfect matching M is strongly graceful, if it has a graceful labeling f such that for any uv ∈ M, f（u） ＋ f（v） = n - 1. We define the definition of bipartite odd-graceful trees and the strongly graceful trees. Then we prove that every Fibonacci lobster tree is bipartite odd-graceful and strongly graceful tree.
出处
《数学的实践与认识》
北大核心
2016年第7期181-186,共6页
Mathematics in Practice and Theory
基金
国家自然科学基金(61163037
61163054
61363060)
关键词
对虾树
斐波纳契对虾树
优美标号
二分奇优美
强优美
lobster tree
Fibonacci lobster tree
graceful labeling
bipartite-odd graceful
strongly graceful.
