پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 43 |
| تعداد شماره‌ها | 1,744 |
| تعداد مقالات | 14,253 |
| تعداد مشاهده مقاله | 35,313,164 |
| تعداد دریافت فایل اصل مقاله | 14,018,585 |
The Graceful Labeling of Vee Graph | ||
| Transactions on Combinatorics | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 04 تیر 1404 | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22108/toc.2025.143231.2220 | ||
| نویسندگان | ||
| Andika Ellena Saufika Hakim Maharani* 1؛ Ivan Luthfi Ihwani2؛ Yeni Susanti3؛ Mamika Ujianita Romdhini1 | ||
| 1Department of Mathematics, Faculty of Mathematics and Natural Science, University of Mataram, Mataram, Indonesia | ||
| 2Department of Mathematics, Faculty of Mathematics and Natural Science, Gadjah Mada University, Yogyakarta, Indonesia | ||
| 3Department of Mathematics, Faculty of Mathematics and Natural Sciences, Gadjah Mada University, Yogyakarta, Indonesia | ||
| چکیده | ||
| Graph labeling is the process of assigning numerical values, typically integers, to the elements of a graph. This study focuses on a specific type of labeling called graceful labeling. In graceful labeling, each vertex of the graph is assigned a unique number such that the differences between these numbers assigned to the end vertices of each edge result in unique values. This article introduces a new graph structure called the Vee graph, which is formed by attaching two grid graphs at one of their corresponding end edges. We demonstrate that the Vee graph can be labeled gracefully, meaning that it satisfies the criteria of graceful labeling. Additionally, the paper provides examples to illustrate graceful labeling for different variations of Vee graphs. | ||
| کلیدواژه‌ها | ||
| Graceful Labeling؛ Graph Labeling؛ Graph Structure؛ Grid Graph؛ Vee Graph | ||
|
آمار تعداد مشاهده مقاله: 51 |
||