
تعداد نشریات | 162 |
تعداد شمارهها | 6,693 |
تعداد مقالات | 72,239 |
تعداد مشاهده مقاله | 129,233,711 |
تعداد دریافت فایل اصل مقاله | 102,068,061 |
NEW FAMILIES OF PAIR DIFFERENCE CORDIAL GRAPHS | ||
Journal of Algorithms and Computation | ||
دوره 56، شماره 2، اسفند 2024، صفحه 113-122 اصل مقاله (537.2 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2025.389895.1221 | ||
نویسندگان | ||
R Ponraj* 1؛ A GAYATHRI2 | ||
1Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India | ||
2Department of Mathematics, Sri Paramakalyani College, Alwarkurichi–627 412, India | ||
چکیده | ||
In this paper we investigate the pair difference cordial labeling behaviour of diamond ladder graph,lattitude ladder, octopus graph,pagoda graph, planter graph and semi jahangir graph. Prime labeling behaviour of planter graph, duplication of planter graph, fusion of planter graph,switching of planter graph, joining of two copies of planter graph were studied by A.Edward samuel and S.Kalaivani[4]. Dafik, Riniatul Nur Wahidah hve been examined the Rainbow Antimagic coloring of special graphs like volcano, sandat graph, sunflower,octpus, semijahangir [3]. Prihandini,R M., at.el have been studied the elegant labeling of shackle graphs and diamond ladder graphs [16]. Classical meanness of some graphs such as one-side step graph,double-sided step graph,grid,slanding ladder,diamond ladder,lattitude ladder was studied by Alanazi et. al [1]. In [17] Yeni Susanti et. al studied the edge odd geaceful labeling behaviour of prism, antiprism, cartesian product graphs. The notion of pair diference cordial labeling of a graph was in troduced in [7]. | ||
کلیدواژهها | ||
Diamond Ladder graph؛ Octopus graph؛ Pagoda graph؛ Planter graph؛ Semi Jahangir graph | ||
آمار تعداد مشاهده مقاله: 29 تعداد دریافت فایل اصل مقاله: 104 |