پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 11 |
| تعداد شماره‌ها | 220 |
| تعداد مقالات | 2,206 |
| تعداد مشاهده مقاله | 3,221,338 |
| تعداد دریافت فایل اصل مقاله | 2,320,776 |
Generalized k-plane trees | ||
| Journal of Discrete Mathematics and Its Applications | ||
| دوره 10، شماره 2، شهریور 2025، صفحه 161-182 اصل مقاله (362.34 K) | ||
| نوع مقاله: Full Length Article | ||
| شناسه دیجیتال (DOI): 10.22061/jdma.2025.11859.1122 | ||
| نویسندگان | ||
| Isaac Owino Okoth* 1؛ Albert Oloo Nyariaro2؛ Fredrick Oluoch Nyamwala3 | ||
| 1Department of Pure and Applied Mathematics, School of Mathematics, Statistics and Actuarial Science, Maseno University, Maseno, Kenya | ||
| 2Department of Mathematics, Physics and Computing, Moi University, Eldoret, Kenya. | ||
| 3Department of Mathematics, Physics and Computing, Moi University, Eldoret, Kenya | ||
| تاریخ دریافت: 26 اسفند 1403، تاریخ بازنگری: 05 فروردین 1404، تاریخ پذیرش: 04 اردیبهشت 1404 | ||
| چکیده | ||
| Plane trees and noncrossing trees have been generalized by assigning labels to the vertices from a given set such that a prior coherence condition is satisfied. These trees are called k-plane trees and k-noncrossing trees respectively if k labels are used. Results of plane trees and noncrossing trees were recently unified by considering d-dimensional plane trees where plane trees are 1-dimensional plane trees and noncrossing trees are 2-dimensional plane trees. In this paper, d-dimensional k-plane trees are introduced and enumerated according to number of vertices and label of the root, root degree, number of components constituting a forest, label of the eldest child of the root and the length of the leftmost path. The equivalent results for plane trees and noncrossing trees follow easily from our results as corollaries. | ||
| کلیدواژه‌ها | ||
| d-dimensional؛ root degree؛ forest؛ eldest child؛ leftmost path | ||
|
آمار تعداد مشاهده مقاله: 25 تعداد دریافت فایل اصل مقاله: 8 |
||