Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

Abstract.Let 𝐺 be a simple graph of order 𝑛. The domination polynomial of 𝐺 is the polynomial D(G,x)= ∑ i=0 n d(G,i) x i , where 𝑑(𝐺,𝑖) is the number of dominating sets of 𝐺 of size 𝑖. Let 𝑛 ...