A Study on Equitable Restrained Domination in Graphs

Abstract

We study equitable restrained domination in graphs, a concept combining restrained and equitable domination. A set  is an equitable restrained dominating set if it is both restrained and equitable and the minimum cardinality of such a set is the equitable restrained domination number . In this paper, we establish bounds for  and explore its relationships with other domination parameters. Additionally, we examine the effect of graph operation, the join of two graphs on .