Neighborhood Cordial (Nhd-C) Labeling - A New Method of Graph Labeling

Abstract

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 (C₃,n), pathunion Pm(C₃), Pm (C₄),K_1,m: K_1,m , TreeYn are nhd-c graphs.