Some Path Related 4-Cordial Graphs

N.B. Rathod, Kailas Khimjibhai Kanani · International Journal of Mathematics and Soft Computing · 2015

In this paper, we discuss 4-cordial labeling of some path related graphs. We prove that middle graph, total graph and splitting graph of the path are 4-cordial. In addition to this we prove that P 2n and triangular snakes are 4-cordial.

Read the paper · More papers on PaperTik