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.
Set-labeling of graphs set-cordial labeling set-cordial graphs weakly set-cordial graphs.
Birincil Dil | İngilizce |
---|---|
Konular | Matematik |
Bölüm | Research Article |
Yazarlar | |
Yayımlanma Tarihi | 30 Haziran 2022 |
Gönderilme Tarihi | 1 Nisan 2019 |
Kabul Tarihi | 27 Mart 2022 |
Yayımlandığı Sayı | Yıl 2022 Cilt: 71 Sayı: 2 |
Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics.
This work is licensed under a Creative Commons Attribution 4.0 International License.