Ex. Associate Professor, Department of Mathematics, Shri Kelkar College, Devgad, Sindhudurg, Maharashtra. India-416613
We introduce a new technique of graph labeling named as Neighborhood Cordial (Nhd-C) Labeling of Graphs and show that paths, cycles, FL (Cn), S (C3, n), pathunion Pm(C3), Pm (C4), K1, m: K1, m, TreeYn are nhd-c graphs.
Nhd, neighborhood, cordial, pathunion, snakes, flag graph etc