Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G, x) =Sigma(n)(n=r(g))d(G, i)x(i), where d(G,i) is the number of dominating sets of G of size i and r(G) is the domination number of G. The number of dominating sets of a graph G is D(G,1). In this paper we consider cactus chains with triangular and square blocks and study their domination polynomials.
机构:
National Research University Higher School of Economics, Nizhny Novgorod Branch, Nizhny Novgorod
St. Petersburg State University, St. PetersburgNational Research University Higher School of Economics, Nizhny Novgorod Branch, Nizhny Novgorod
机构:
MTA ELTE Geometr & Algebra Combinator Res Grp, Pazmany P Setany 1-C, H-1117 Budapest, HungaryMTA ELTE Geometr & Algebra Combinator Res Grp, Pazmany P Setany 1-C, H-1117 Budapest, Hungary