Restrained step triple connected domination polynomial
Abstract
In 2019, G. Mahadevan et,al. introduced a domination parameter called restrained step triple connected domination number in graphs and found its number for some standard and special type of graphs. In this paper we initiate a new domination polynomial called restrained step triple connected domination polynomial defined as “let be the family of restrained step triple connected dominating sets of a graph G with cardinality i and let then the restrained step triple connected domination polynomial of G is defined as , where is the restrained step triple connected domination number of G”.