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

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

 آمار

تعداد نشریات158
تعداد شماره‌ها6,225
تعداد مقالات67,690
تعداد مشاهده مقاله115,002,882
تعداد دریافت فایل اصل مقاله89,681,699
Ponraj, R, Gayathri, A, M.Sivakumar, Prof.Dr. (1401). Pair Difference Cordial Labeling of $m-$ copies of Path, Cycle, Star, and Ladder Graphs. , 54(2), 37-47. doi: 10.22059/jac.2022.90409
R Ponraj; A Gayathri; Prof.Dr M.Sivakumar. "Pair Difference Cordial Labeling of $m-$ copies of Path, Cycle, Star, and Ladder Graphs". , 54, 2, 1401, 37-47. doi: 10.22059/jac.2022.90409
Ponraj, R, Gayathri, A, M.Sivakumar, Prof.Dr. (1401). 'Pair Difference Cordial Labeling of $m-$ copies of Path, Cycle, Star, and Ladder Graphs', , 54(2), pp. 37-47. doi: 10.22059/jac.2022.90409
Ponraj, R, Gayathri, A, M.Sivakumar, Prof.Dr. Pair Difference Cordial Labeling of $m-$ copies of Path, Cycle, Star, and Ladder Graphs. , 1401; 54(2): 37-47. doi: 10.22059/jac.2022.90409

Pair Difference Cordial Labeling of $m-$ copies of Path, Cycle, Star, and Ladder Graphs

Journal of Algorithms and Computation
دوره 54، شماره 2، اسفند 2022، صفحه 37-47    اصل مقاله (296.75 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2022.90409
نویسندگان
R Ponraj* 1؛ A Gayathri2؛ Prof.Dr M.Sivakumar3
1Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India
2Research Scholor,Reg.No:20124012092023 Department of Mathematics Manonmaniam Sundaranar University, Abhishekapati,Tirunelveli–627 012, India
3Head, Department of Mathematis Thiruvalluvar University College of Arts and Science Tittagudi Tamilnadu ,India
چکیده
In this paper, we consider only finite, undirected, and simple graphs. The concept of cordial labeling was introduced by Cahit[4]. Different types of cordial-related labeling were studied in [1, 2, 3, 5, 16]. In a similar line, the notion of pair difference cordial labeling of a graph was introduced in [8]. The pair difference cordial labeling behavior of several graphs like path, cycle, star, wheel, triangular snake, alternate triangular snake, butterfly, ladder, Mobius ladder, slanting ladder, and union of some graphs have been investigated in [ 8, 9, 10, 11, 12, 13, 14, 15]. The $m-$ copies of a graph $G$ is denoted by $mG$ [7]. In this paper, we investigate the pair difference cordial labeling behavior of $m-$ copies of Path, Star, Cycle, and Ladder graphs.
کلیدواژه‌ها
Path؛ Cycle؛ Ladder؛ Star
آمار
تعداد مشاهده مقاله: 60
تعداد دریافت فایل اصل مقاله: 97


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