Naduvath, Sudev2022-12-272022-12-272022https://doi.org/10.31801/cfsuasmas.547410http://hdl.handle.net/20.500.12575/86485For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph G is an injective function f:V(G)→P(X), where P(X) is the power set of the set X. 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.enSet-labeling of graphs, set-cordial labeling, set-cordial graphs, weakly set-cordial graphs.Article7123393481303-5991