Article
A Novel Problem for Solving Cordial Labeling of Corona Product Between Path and Third Order of Cone Graphs
Authors
, and
Abstract
A simple graph is said to be cordial if it admits 0 -1 labeling that satisfies certain conditions. In this paper we investigate necessary and sufficient conditions for cordial labeling of the corona Product between path and third order of cone graphs.
Keywords
Path, Cone, Third power of graph, Corona Product, Cordial labeling
Citation
Elrokh, A., Al-Shamiri, M. M. A., & El-Hay, A. A. (2022). 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, 13(3), 970–986.
A. Elrokh, M. M. A. Al-Shamiri and A. A. 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, vol. 13, no. 3, pp. 970–986, 2022.
Elrokh A, Al-Shamiri MMA, El-Hay AA. 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. 2022;13(3):970–986.
Elrokh, A., Al-Shamiri, M. M. A. and El-Hay, A. A. (2022), ‘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, 13(3), pp. 970–986.
Elrokh, A., et al. “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, vol. 13, no. 3, 2022, pp. 970–986.
Elrokh, A., M. M. Ali Al-Shamiri, and Atef 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 13, no. 3 (2022): 970–986.
Export citation
Published by: Engineering Journals
