Independent domination polynomial of zero-divisor graphs of commutative rings

被引:1
|
作者
Gursoy, Necla Kircali [1 ]
Ulker, Alper [2 ]
Gursoy, Arif [3 ]
机构
[1] Ege Univ, Tire Kutsan Vocat Sch, TR-35900 Tire, Bakirkoy, Turkey
[2] Istanbul Kultur Univ, Dept Math & Comp Sci, TR-34156 Istanbul, Turkey
[3] Ege Univ, Dept Math, TR-35100 Izmir, Turkey
关键词
Independent domination polynomial; Independent dominating set; Zero-divisor graph; Independent set; Domination number; Maximal independent set;
D O I
10.1007/s00500-077-07217-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页数:9
相关论文
共 50 条