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

摘要

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_3,n), pathunion Pm(C_3), Pm (C_4),K_(1,m): K_(1,m), TreeYn are nhd-c graphs.