پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,228 |
| تعداد مقالات | 67,740 |
| تعداد مشاهده مقاله | 115,072,058 |
| تعداد دریافت فایل اصل مقاله | 89,801,455 |
Totally magic cordial labeling of some graphs | ||
| Journal of Algorithms and Computation | ||
| مقاله 1، دوره 46، شماره 1، اسفند 2015، صفحه 1-8 اصل مقاله (661.7 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2015.7921 | ||
| نویسندگان | ||
| P. Jeyanthi* 1؛ N. Angel Benseera2 | ||
| 12Research Center, Department of Mathematics, Aditanar College for women, Tiruchendur - 628 216, India | ||
| 2Department of Mathematics, Sri enakshi Government Arts College for Women (Autonomous), Madurai - 625 002, India. | ||
| چکیده | ||
| A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and also prove that some families of graphs admit totally magic cordial labeling. | ||
| کلیدواژه‌ها | ||
| Cordial labeling؛ Totally magic cordial labeling | ||
|
آمار تعداد مشاهده مقاله: 1,436 تعداد دریافت فایل اصل مقاله: 1,886 |
||