آمار
| تعداد نشریات | 26 |
| تعداد شماره‌ها | 447 |
| تعداد مقالات | 4,557 |
| تعداد مشاهده مقاله | 5,380,005 |
| تعداد دریافت فایل اصل مقاله | 3,580,083 |
Pair difference cordial labeling of some star related graphs | ||
| Journal of Mahani Mathematical Research | ||
| دوره 12، شماره 2 - شماره پیاپی 25، مرداد 2023، صفحه 255-266 اصل مقاله (521.58 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22103/jmmr.2022.19577.1270 | ||
| نویسندگان | ||
| R Ponraj* 1؛ A Gayathri2؛ S Somasundaram2 | ||
| 1Department of Mathematics , Sri Paramakalyani Collge , Alwarkurichi -627 412 , India | ||
| 2Department of Mathematics, Manonmaniam Sundaranar University, Abhishekapati,Tirunelveli--627 012, India | ||
| چکیده | ||
| In this paper, we investigate the pair difference cordial labeling behaviour of some star related graphs. | ||
| کلیدواژه‌ها | ||
| Banana tree؛ Lilly graph؛ Shrub؛ Star | ||
| مراجع | ||
|
[1] I. Cahit, Cordial Graphs : A weaker version of Graceful and Harmonious graphs, Ars Combinatoria., 23 (1987), 201{207.
[2] A.T. Diab, Study of some problems of cordial graphs , Ars combinatoria., 92 (2009), 255{261.
[3] J.A. Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics., 19, (2016).
[4] G.V. Ghodasara and Sonchhatra , Cordial labeling of fan related graphs, International Journal of Scienti c and Engineering Research., 4 8 (2013), 470{476.
[5] F. Harary, Graph theory, Addision wesley, New Delhi, 1969.
[6] M. Hovey, A-cordial graphs, Discrete Mathematics., 93 (1993), 183{194.
[7] K. K. Kananani and M. I. Bosmia., On cube divisor cordial graphs, International Journal of Mathematics computer Applications Research., 5(4)(2015) 117 {128.
[8] W.W. Krichher, On the cordiality of some speci c graphs , Ars Combinatoria, 31, (1991), 127{138.
[9] O. Pechnik , J. Wise , Generalized graph cordiality , Discussiones Mathematicae Graph Theory, 32 No. 3 (2012), 557{567.
[10] R. Ponraj, A. Gayathri, and S.Somasundaram, Pair di erence cordial labeling of graphs, Journal of Mathematics and Computer Science.,Vol.11(3), (2021), 2551{2567.
[11] R. Ponraj, A. Gayathri, and S.Somasundaram, Pair di erence cordiality of some snake and buttery graphs, Journal of Algorithms and Computation, Vol.53(1), (2021), 149{163.
[12] R. Ponraj, A. Gayathri, and S.Somasundaram, Pair di erence cordial graphs obtained from the wheels and the paths, Journal of Applied and Pure Mathematics., Vol.3 No. 3-4, (2021), pp. 97{114.
[13] R. Ponraj, A. Gayathri, and S.Somasundaram, Pair di erence cordiality of some graphs derived from ladder graph , Journal of Mathematics and Computer Science., Vol.11 No 5, (2021), 6105{6124.
[14] R. Ponraj, A. Gayathri, and S.Somasundaram, Some pair di erence cordial graphs,Ikonion Journal of Mathematics., Vol.3(2), (2021),17{26.
[15] R. Ponraj, A. Gayathri, and S.Somasundaram, Pair di erence cordial labeling of planar grid and mangolian tent , Journal of Algorithms and Computation, Vol.53(2), December (2021), 47{56.
[16] R. Ponraj, A. Gayathri, and S.Somasundaram, Pair di erence cordiality of some special graphs, Journal of Applied and Pure Mathematics., Vol.3 No. 5-6, (2021), pp. 263{274.
[17] R. Ponraj, A. Gayathri, and S.Somasundaram, Pair di erence cordiality of mirror graph, shadow graph and splitting graph of certain graphs, Maltepe Journal of Mathematics., Vol.4 issue 1, (2022), pp. 24{32.
[18] R. Ponraj, J. V. X. Parthipan, Pair sum labeling of graphs, Journal of Indian Academy of Mathematics., 32(2), (2010), 587{595.
[19] R. Ponraj, S. Sathish narayanan, and R. Kala, Di erence cordial labeling of graphs, Global Journal of Mathematical Sciences : Theory and Practical, 3, (2013), 192{201.
[20] U.M.Prajapati, U.M., and S.J.Gajjar., Cordial labeling for complement graphs,Mathematics Today Vol.30, (2015), 99{118.
[21] M.A.Seoud., M.S.Salman., Some results and examples on di erence cordial graphs, Turkish Journal of Mathematics, 40, (2016), 417{427. | ||
|
آمار تعداد مشاهده مقاله: 147 تعداد دریافت فایل اصل مقاله: 262 |
||