%0 Journal Article %T Cordial Labeling of Corona Product of Path Graph and Second Power of Fan Graph %A Ashraf Ibrahim Hefnawy Elrokh %A Shokry Ibrahim Mohamed Nada %A Eman Mohamed El-Sayed El-Shafey %J Open Journal of Discrete Mathematics %P 31-42 %@ 2161-7643 %D 2021 %I Scientific Research Publishing %R 10.4236/ojdm.2021.112003 %X
A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs and explain the necessary and sufficient conditions for this construction to be cordial.
%K Corona %K Second Power of Fan %K Cordial Graph %U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=108431