Prime Cordial Labeling of Some Graphs

Abstract

In this paper we prove that the split graphs of K 1,n and B n,n are prime cordial graphs. We also show that the square graph of B n,n is a prime cordial graph while middle graph of P n is a prime cordial graph for n≥4 . Further we prove that the wheel graph W n admits prime cordial labeling for n≥8.