A graph is considered total cordial if it can be assigned a 0-1 labeling that meets specific conditions. In this paper, we show that is total cordial if  Moreover, we study the cordiality corona product of paths and the third power of double fans. Also, we obtain that the cordiality of the corona  between paths  and the third power of generalized fans  is total cordial for n, k ≥ 1  all and m > 4.

total cordial, fan, path corona product, third power of graph

Received: October 15, 2024; Revised: November 10, 2024; Accepted: December 20, 2024; Published: March 4, 2025

How to cite this article: Y. Elmshtaye, A. Elrokh and Atef Abd El-hay, Total cordial for the corona product of paths and the third power of double fans-generalized fans, Advances and Applications in Discrete Mathematics 42(4) (2025), 303-334. https://doi.org/10.17654/0974165825020

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:
[1] A. Krishnaa, Some applications of labelled graphs, International Journal of Mathematics Trends and Technology (IJMTT) 37(3) (2016), 209-213.
[2] Deo Narsingh, Graph Theory with Application to Engineering and Computer Science, Prentice Hall of India Pvt., New Delhi, India, 2003.
[3] N. Hartsfield and G. Ringel, Pearls in Graph Theory: A Comprehensive Introduction, Academic Press Inc., Boston, USA, 1990.
[4] J. A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. 17(DS6) (2010), 1-246.
[5] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs, Internet. Symposium, Rome, 1966, Gordon and Breach, N. Y. and Dunod Paris, 1967, pp. 349-355.
[6] S. W. Golomb, How to number a graph, Graph Theory and Computing, R. C. Read, ed., Academic Press, New York, 1972.
[7] R. L. Graham and N. J. A. Sloane, On additive bases and harmonious graphs, SIAM J. Alg. Discrete Math. 1 (1980), 382-404.
[8] I. Cahit, On cordial and 3-equitable labeling of graphs, Util. Math. 37 (1990), 189-198.
[9] Ashraf ELrokh, Mohammed M. Ali Al-Shamiri and Atef Abd El-hay, A novel problem to solve the logically labeling of corona between paths and cycles, Journal of Mathematics 2022 (2022), 11, Article ID 2312206.
[10] Ashraf ELrokh, Mohammed M. Ali Al-Shamiri and Atef Abd El-hay, A novel radio geometric mean algorithm for a graph, Symmetry 15(3) (2023), 570.
https://doi.org/10.3390/sym15030570.
[11] E. A. Elsakhawy, The cordiality for the join of pairs of the third power of paths, Appl. Math. 16(4) (2022), 611-615.
[12] Atef Abd El-hay and A. Elrokh, Total cordial labeling of corona product of paths and second power of fan graph, Turkish Journal of Computer and Mathematics Education (TURCOMAT) 13(03) (2022), 681-690.
[13] A. Elrokh, Y. Elmshtaye and Atef. Abd El-hay, The cordiality of cone and lemniscate graphs, Applied Mathematics and Information Sciences 16 (2022), 1027-1034. 10.18576/amis/160620.
[14] S. Nada, A. Elrokh and Atef Abd El-hay, On singed product cordial of cone graph and its second power, Turkish Journal of Computer and Mathematics Education (TURCOMAT) 13(03) (2022), 597-606.
[15] Ashraf ELrokh, Mohammed M. Ali Al-Shamiri, Shokry Nada and Atef Abd El-hay, Cordial and total cordial labeling of corona product of paths and second order of lemniscate graphs, Journal of Mathematics 2022 (2022), 9, Article ID 8521810. https://doi.org/10.1155/2022/8521810.
[16] Ashraf ELrokh, Mohammed M. Ali Al-Shamiri, Mohammed M. A. Almazah and Atef Abd El-hay, A novel problem for solving permuted cordial labeling of graphs, Symmetry 15(4) (2023), 825.
[17] Atef Abd El-hay, Studies of different labeling on path and cycle with other types of graphs, Doctoral Thesis, Menoufia University, 2024.
[18] A. Abd El-hay and A. Rabie, Signed product cordial labeling of corona product between paths and second power of fan graphs, Ital. J. Pure Appl. Math. 48 (2022), 287-294.
[19] S. Nada, A. Elrokh and A. Abd El-hay, On signed product cordial of lemniscate graph and its second power, Turkish Journal of Computer and Mathematics Education (TURCOMAT) 13(03) (2022), 905-913.
[20] A. Elrokh, M. A. Al-shamiri and A. Abd El-hay, A novel problem for solving cordial labeling of corona product between path and third order of cone graphs, Turkish Journal of Computer and Mathematics Education (TURCOMAT) 13(03) (2022), 970-986.
[21] A. Abd El-hay, Y. Elmshtaye and A. Elrokh, Solving singed product cordial labeling of corona products of paths and the third power of lemniscate graphs, Turkish Journal of Computer and Mathematics Education (TURCOMAT) 14(2) (2023), 806-823.