On the domination polynomials of cactus chains

2014/03/08 by ‎Saeid Alikhani, Saeid Alikhani, Alikhani, Saeid +4
Agricultural and Biological Sciences · Mathematics · #05C60 #05C69 #Botanical Research and Applications #Combinatorics (math.CO) #FOS: Mathematics #Plant Diversity and Evolution #Polysaccharides Composition and Applications #math.CO #msc:05C60 #msc:05C69

paper · pdf · doi:10.48550/arxiv.1403.1999

13 pages

openalex publication_date 2014/03/08 · arxiv created 2014/04/02 · arxiv updated 2014/04/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G, x)=∑_i=γ(G)ⁿ d(G,i) xⁱ, where d(G,i) is the number of dominating sets of G of size i and γ(G) is the domination number of G. In this paper we consider cactus chains with triangular and square blocks and study their domination polynomials.

Citations

• Fibonacci Numbers of Graphs

Related

• Some new results on domination roots of a graph
• Domination polynomials of k-tree related graphs
• Introduction to Domination Polynomial of a Graph
• An atlas of domination polynomials of graphs of order at most six
• Some families of graphs whose domination polynomials are unimodal