Domination is one of those important parameters in graph theory which has a very wide range of applications. There are various types of domination depending on the structure of dominating sets. In this study, a new domination parameter called edge co-even domination number is introduced and denoted by γ_coe^' (G). Some basic graphs such as path, cycle, complete, complete bipartite, star, regular, wheel and their complement graphs are examined of this definition. In addition, some results of this parameter are found under graph operations, such as corona and cartesian product.
Domination Edge co-even dominating set Edge co-even domination number
Birincil Dil | İngilizce |
---|---|
Konular | Temel Matematik (Diğer) |
Bölüm | Matematik / Mathematics |
Yazarlar | |
Erken Görünüm Tarihi | 20 Şubat 2025 |
Yayımlanma Tarihi | 1 Mart 2025 |
Gönderilme Tarihi | 11 Mayıs 2024 |
Kabul Tarihi | 7 Kasım 2024 |
Yayımlandığı Sayı | Yıl 2025 Cilt: 15 Sayı: 1 |