Graceful Labeling of some classes of Spider Graphs with Three legs greater than one

被引：0
|
作者：
Jampachon, P. [1 ]
Nakprasit, K. [1 ]
Poomsa-ard, T. [1 ]
机构：
[1] Khon Kaen Univ, Fac Sci, Dept Math, Khon Kaen, Thailand
来源：
THAI JOURNAL OF MATHEMATICS | 2014年 / 12卷 / 03期
关键词：
Spider graphs; Graceful labeling; Inverse transformatin;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A spider graph is a tree with at most one vertex of degree greater than 2. A graceful labeling of a tree T with n edges is a bijection f : V (T) -> {0, 1, 2, ... , n} g such that {|f(u) - f (v)| : {u, v} is an edge of T} = {1, 2, ..., n}. We show that some classes of spider graphs admit graceful labeling.
引用
收藏
页码：621 / 630
页数：10
相关论文
共 46 条
12345