A study on set-cordial labeling of graphs

Authors : Sudev NADUVATH

Pages : 339-348

Doi:10.31801/cfsuasmas.547410

View : 12 | Download : 6

Publication Date : 2022-06-30

Article Type : Research Paper

Abstract :For a non-empty ground set X X , finite or infinite, the set-valuation or set-labeling of a given graph G G is an injective function f : V insert ignore into journalissuearticles values( G ); → P insert ignore into journalissuearticles values( X ); f:Vinsert ignore into journalissuearticles values(G);→Pinsert ignore into journalissuearticles values(X); , where P insert ignore into journalissuearticles values( X ); Pinsert ignore into journalissuearticles values(X); is the power set of the set X 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.
Keywords : Set labeling of graphs, set cordial labeling, set cordial graphs, weakly set cordial graphs