سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات162
تعداد شماره‌ها6,578
تعداد مقالات71,072
تعداد مشاهده مقاله125,699,768
تعداد دریافت فایل اصل مقاله98,933,805
Ponraj, R., Singh, Rajpal, Sathish Narayanan, S., Ramasamy, A. M. S.. (1395). 4-Prime cordiality of some classes of graphs. , 48(1), 69-79. doi: 10.22059/jac.2016.7941
R. Ponraj; Rajpal Singh; S. Sathish Narayanan; A. M. S. Ramasamy. "4-Prime cordiality of some classes of graphs". , 48, 1, 1395, 69-79. doi: 10.22059/jac.2016.7941
Ponraj, R., Singh, Rajpal, Sathish Narayanan, S., Ramasamy, A. M. S.. (1395). '4-Prime cordiality of some classes of graphs', , 48(1), pp. 69-79. doi: 10.22059/jac.2016.7941
Ponraj, R., Singh, Rajpal, Sathish Narayanan, S., Ramasamy, A. M. S.. 4-Prime cordiality of some classes of graphs. , 1395; 48(1): 69-79. doi: 10.22059/jac.2016.7941

4-Prime cordiality of some classes of graphs

Journal of Algorithms and Computation
مقاله 5، دوره 48، شماره 1، اسفند 2016، صفحه 69-79    اصل مقاله (743.63 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2016.7941
نویسندگان
R. Ponraj* 1؛ Rajpal Singh2؛ S. Sathish Narayanan1؛ A. M. S. Ramasamy3
1Department of Mathematics, Sri Paramakalyani College,Alwarkurichi-627 412, India
2Research Scholar, Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli-627012, India
3Department of Mathematics, Vel Tech Dr.R.R & Dr.S.R Technical University, Chennai-600002, India
چکیده
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate 4- prime cordial labeling behavior of complete graph, book, flower, mCn and some more graphs.
کلیدواژه‌ها
complete graph؛ Wheel؛ Path؛ book؛ flower
آمار
تعداد مشاهده مقاله: 1,276
تعداد دریافت فایل اصل مقاله: 1,014





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب