A study on set-cordial labeling of graphs

For a non-empty ground set XX, finite or infinite, the set-valuation or set-labeling of a given graph GG is an injective function f:V(G)→P(X)f:V(G)→P(X), where P(X)P(X) is the power set of the set XX. In this paper, we introduce a new type of set-labeling, called set-cordial labeling and study the characteristics of graphs which admit the set-cordial labeling.