پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 162 |
| تعداد شماره‌ها | 6,578 |
| تعداد مقالات | 71,072 |
| تعداد مشاهده مقاله | 125,699,595 |
| تعداد دریافت فایل اصل مقاله | 98,933,627 |
Constructing Graceful Graphs with Caterpillars | ||
| Journal of Algorithms and Computation | ||
| مقاله 8، دوره 48، شماره 1، اسفند 2016، صفحه 117-125 اصل مقاله (447.33 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2016.7946 | ||
| نویسندگان | ||
| Christian Barrientos* ؛ Sarah Minion | ||
| Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA | ||
| چکیده | ||
| A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute di erence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f is called an -labeling and G is said to be an α-graph. A tree is a caterpillar if the deletion of all its leaves results in a path. In this work we study graceful labelings of the disjoint union of a cycle and a caterpillar. We present necessary conditions for this union to be graceful and, in the case where the cycle has even size, to be an α -graph. In addition, we present a new family of graceful trees constructed using α-labeled caterpillars. | ||
| کلیدواژه‌ها | ||
| graceful labeling؛ caterpillar؛ graceful trees | ||
|
آمار تعداد مشاهده مقاله: 1,859 تعداد دریافت فایل اصل مقاله: 1,707 |
||
سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب