<div style="text-align:justify;"> <span style="font-family:Verdana;">A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we cons...<div style="text-align:justify;"> <span style="font-family:Verdana;">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.</span> </div>展开更多
文摘<div style="text-align:justify;"> <span style="font-family:Verdana;">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.</span> </div>