Yayın: Independent Domination Polynomial of Zero-Divisor Graphs of Commutative Rings
Yükleniyor...
Dosyalar
Tarih
2022
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayımcı
Springer
Özet
An independent dominating set of a graph is a vertex subset that is both dominating and independent set in the graph, i.e., a maximal independent set. Also, the independent domination polynomial is an ordinary generating function for the number of independent dominating sets in the graph. In this paper, we examine independent domination polynomials of zero-divisor graphs of the ring Z(n) where n is an element of {2p, p(2), p(alpha), pq, p(2)q, pqr) and their roots. Finally, we prove the log-concavity and unimodality of their independent domination polynomials.
Açıklama
Anahtar kelimeler
Independent Domination Polynomial, Independent Dominating Set, Zero-divisor Graph, Independent Set, Domination Number, Maximal Independent Set
Alıntı
Kırcalı Gürsoy, N., Ülker, A. & Gürsoy, A. Independent domination polynomial of zero-divisor graphs of commutative rings. Soft Comput 26;(15), 6989–6997 (2022).