Restrained geodetic domination polynomial

For a connected graph [Formula: see text], a vertex subset [Formula: see text] of [Formula: see text] is said to be a restrained geodetic dominating set if [Formula: see text] is both geodetic and dominating set of [Formula: see text] and also, the subgraph induced by [Formula: see text] consists of no vertex with degree zero. From the study of domination polynomial and geodetic domination polynomial, we have initiated the study on restrained geodetic domination polynomial.