Restrained Step Domination Number for Some Amusing Product Graph of Paths and Cycle
G. Mahadevan1, M. Vimala Suganthi2
1Dr. G. Mahadevan, Assistant Professor, Department of Mathematics, Gandhigram Rural Institute Deemed to be University, Gandhigram (Tamil Nadu), India.
2M. Vimala Suganthi, Research Scholar, Department of Mathematics, Gandhigram Rural Insitute Deemed to be University, Gandhigram (Tamil Nadu), India.
Manuscript received on 18 January 2020 | Revised Manuscript received on 01 February 2020 | Manuscript Published on 05 February 2020 | PP: 24-28 | Volume-8 Issue-4S5 December 2019 | Retrieval Number: D10101284S519/2019©BEIESP | DOI: 10.35940/ijrte.D1010.1284S519
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: G. Mahadevan, et, al., introduced the concept of restrained step domination number of a graph. A set of a graph G is said to be restrained step dominating set, if is the restrained dominating set and is a perfect matching. The minimum cardinality taken over all the restrained step dominating set is called the restrained step domination number of G and is denoted by (G). In this paper we explore this parameter for some product graph of path and cycle.
Keywords: Complementary Perfect Domination, Restrained Domination, Restrained Step Domination.
Scope of the Article: Cryptography and Applied Mathematics