Sum and Product of Strong Restrained Domination Number of Path and its Derived Graph

M. Selvaloganayaki , P. Namasivayam

Domination, Strong domination, Restrained domination, Strong restrained domination

Let G = (V, E) be a simple graph with p vertices and q edges. Let S  V(G). S is called a strong restrained dominating set of G if for every u  V – S, there exists v  S and w  V – S such that v and w strongly dominate u. The minimum cardinality of a strong restrained dominating set of G is called the strong restrained domination number of G and is denoted by γsrd(G). The existence of a strong restrained dominating set of G is guaranteed, since V(G) is a strong restrained dominating set of G. In this paper, the sum and product of strong restrained domination number of path and its derived graph are studied.

Published Paper   E-Certificate

"Sum and Product of Strong Restrained Domination Number of Path and its Derived Graph", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.3, Issue 10, page no.37 - 41, October-2018, Available :https://ijsdr.org/papers/IJSDR1810007.pdf

Volume 3 Issue 10, October-2018

Pages : 37 - 41

Paper Reg. ID: IJSDR_180678

Published Paper Id: IJSDR1810007

Downloads: 000347057

Research Area: Applied Mathematics

Country: Tirunelveli, Tamilnadu, India

Published Paper PDF: https://ijsdr.org/papers/IJSDR1810007

Published Paper URL: https://ijsdr.org/viewpaperforall?paper=IJSDR1810007

ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Publisher: IJSDR(IJ Publication) Janvi Wave

This work is licensed under a Creative Commons Attribution 4.0 International License and The Open Definition