Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Let ???? be a simple graph of order ????. The domsaturation polynomial of a graph ???? of order ???? is the polynomial ????????(????, ????) = ∑ ????(????, ????) ???? ????=???????? ???? ???? , where ????(????, ????) is the number of dominating sets of ???? of size ????. The domsaturation number of ???? is the least positive integer ???? such that every vertex of ???? lies in a dominating set of cardinality ????. In this paper, we obtain the domination polynomial and minimal domination polynomial of a graph