Restrained step triple connected domination number of a graph
Gopalakrishnan Mahadevan, M. Vimala Suganthi, A. Iravithul Basira · Journal of Discrete Mathematical Sciences and Cryptography · 2019
In this paper, we introduce the new parameter called restrained step triple connected domination number of a graph. A set S ⊆ V of a graph G is said to be restrained step triple connected dominating set, if is the restrained triple connected dominating set and is a perfect matching. The minimum cardinality taken over all the restrained step triple connected dominating sets is called the restrained step triple connected domination number of G and is denoted by γrstc (G). In this paper we investigate this parameter for some standard classes of graphs, special types of graphs, and some product related graphs.