کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8902774 1632245 2017 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Construction of an α-labeled tree from a given set of α-labeled trees
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Construction of an α-labeled tree from a given set of α-labeled trees
چکیده انگلیسی
Inspired by the method of Koh et al. (1979) of combining known graceful trees to construct bigger graceful trees, a new class of graceful trees is constructed from a set of k known graceful trees, k≥2 in a specific way. In fact, each member of this new class of trees admits α-labeling, a stronger version of graceful labeling. Consequently, each member of this family of trees decomposes complete graphs and complete bipartite graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: AKCE International Journal of Graphs and Combinatorics - Volume 14, Issue 2, August 2017, Pages 118-129
نویسندگان
, ,