آمار
| تعداد نشریات | 7 |
| تعداد شمارهها | 41 |
| تعداد مقالات | 289 |
| تعداد مشاهده مقاله | 309,065 |
| تعداد دریافت فایل اصل مقاله | 195,237 |
Graceful labelings of the generalized Petersen graphs | ||
| Communications in Combinatorics and Optimization | ||
| مقاله 6، دوره 2، شماره 2، پاییز 2017، صفحه 149-159 اصل مقاله (451 K) | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2017.25918.1055 | ||
| نویسندگان | ||
Aleksander Vesel  1؛ Zehui Shao2؛ Fei Deng3؛ Zepeng Li4
| ||
| 1University of Maribor | ||
| 2School of Information Science & Technology, Chengdu University, Chengdu, China | ||
| 3College of Information Science and Technology, Chengdu University of Technology, Chengdu, China | ||
| 4Key Laboratory of High Confidence Software Technologies, Peking University, Peking, China | ||
| چکیده | ||
| A graceful labeling of a graph $G=(V,E)$ with $m$ edges is an injection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labels obtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersen graph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set is ${u_iu_{i+1}, u_iv_i, v_iv_{i+k} : 1 leq i leq n }$, where subscript arithmetic is done modulo $n$. We propose a backtracking algorithm with a specific static variable ordering and dynamic value ordering to find graceful labelings for generalized Petersen graphs. Experimental results show that the presented approach strongly outperforms the standard backtracking algorithm. The proposed algorithm is able to find graceful labelings for all generalized Petersen graphs $P(n, k)$ with $n le 75$ within only several seconds. | ||
| کلیدواژه ها | ||
| graceful labeling؛ generalized Petersen graph؛ heuristic | ||
|
آمار تعداد مشاهده مقاله: 440 تعداد دریافت فایل اصل مقاله: 326 |
||
