A study on set-cordial labeling of graphs

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Communications Faculty of Sciences University Ankara Series A1 Mathematics and Statistics
Volume:71 Issue:2
A study on set-cordial labeling of graphs

A study on set-cordial labeling of graphs

Pages : 339-348

View : 39 | Download : 11

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

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.