Azarbaijan Shahid Madani University Communications in Combinatorics and Optimization 2538-2128 Articles in Press 2026 01 31 Counting the number of domatic partitions of specific graphs 15095 10.22049/cco.2026.31164.2765 EN Pedram Asadzadeh Department of Computer Engineering, K. N. Toosi University of Technology, P.O.Box 16765-3381, Tehran, Iran Saeid Alikhani Department of Mathematical Sciences, Yazd University, 89195-741, Yazd, Iran Journal Article 2025 10 30 A subset of vertices $S$ of a graph $G$ is a dominating set if every vertex in $V \setminus S$ has at least one neighbor in $S$. A domatic partition is a partition of the vertices of a graph $G$ into disjoint dominating sets. The domatic number $d(G)$ is the maximum size of a domatic partition. We consider the number of domatic partitions of $G$ with different sizes. Inspired by existing results for trees, this paper extends the analysis to several other important families of graphs. We focus primarily on the coefficient $dp(G,2)$, which counts domatic 2-partitions. We present some recurrence relations for this coefficient for the cycle graphs $C_n$ and the wheel graphs $W_n$. Furthermore, we present precise closed-form formulas for the domatic polynomial of star graphs $K_{1,n}$ and friendship graphs $F_n$. We also derive a formula for $dp(K_{m,n}, 2)$ for complete bipartite graphs. Finally, through a comprehensive computational analysis of all $3$-regular graphs of order $10$, we observe that the Petersen graph cannot be determined by its domatic polynomial. https://comb-opt.azaruniv.ac.ir/article_15095_51762b45c4991da64599a588ed0ae320.pdf