Graph products of the trivariate total domination polynomial and related polynomials

详细信息    查看全文

• 作者：Markus Dod ^{mdod@hs-mittweida.de" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Domination polynomial ; Total domination polynomial ; Graph polynomials ; Graph products
• 刊名：Discrete Applied Mathematics
• 出版年：2016
• 出版时间：20 August 2016
• 年：2016
• 卷：209
• 期：Complete
• 页码：92-101
• 全文大小：380 K

文摘

A vertex subset W⊆V$W\subseteq V$ of the graph G=(V,E)$G=(V,E)$ is a total dominating set if every vertex of the graph is adjacent to at least one vertex in W$W$. The total domination polynomial is the ordinary generating function for the number of total dominating sets in the graph. We investigated some graph products for a generalization of the total domination polynomial, called the trivariate total domination polynomial. We also show that the chromatic polynomial is encoded in the independent domination polynomial of some graph products. These results have a wide applicability to other domination related graph polynomials, e.g. the domination polynomial, the independent domination polynomial or the independence polynomial.