A dominating set of a graph G which intersects every independent set of a maximum cardinality in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by gamma_{it}(G). In this paper we investigate the independent transversal domination number of the path graph P_{n} with the star graph S_{1,m}, the wheel graph W_{1,m} and the complete graph K_{n} under neihgbourhood corona, edge corona and join operation providing \beta(P_{n})>\beta(G).
domination number independent transversal domination number independence number
Birincil Dil | İngilizce |
---|---|
Bölüm | Volume VII Issue I |
Yazarlar | |
Yayımlanma Tarihi | 30 Nisan 2022 |
Yayımlandığı Sayı | Yıl 2022 Cilt: 7 Sayı: 1 |