پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,228 |
| تعداد مقالات | 67,753 |
| تعداد مشاهده مقاله | 115,088,612 |
| تعداد دریافت فایل اصل مقاله | 89,829,919 |
Mixed cycle-E-super magic decomposition of complete bipartite graphs | ||
| Journal of Algorithms and Computation | ||
| مقاله 3، دوره 46، شماره 1، اسفند 2015، صفحه 35-50 اصل مقاله (747.99 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2016.7924 | ||
| نویسندگان | ||
| G. Marimuthu* 1؛ S. Stalin Kumar2 | ||
| 1Department of Mathematics, The Madura College, Madurai -625 011, Tamilnadu, India | ||
| 2Department of Mathematics, The American College, Madurai -625 002, Tamilnadu,India | ||
| چکیده | ||
| An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ 3, E(Hi) ∩ E(Hj) = ∅ for i ≠ j and ∪hi=1E(Hi) = E(G). In this paper, we prove that K2m,2n is mixed cycle-E-super magic decomposable where m ≥ 2, n ≥ 3, with the help of the results found in [1]. | ||
| کلیدواژه‌ها | ||
| H-decomposable graph؛ H-E-super magic labeling؛ mixed cycle-E-super magic decomposable graph | ||
|
آمار تعداد مشاهده مقاله: 1,226 تعداد دریافت فایل اصل مقاله: 1,099 |
||