Secure Domination in Graphs

Abstract

Let G=(V,E) be a graph. A subset S of V is a dominating set of G if every vertex in V \ S is adjacent to a vertex in S. A dominating set S is called a secure dominating set if for each v V \ S there exists u S such that v is adjacent to u and S1=(S-{u}) {v} is a dominating set. In this paper we introduce the concept of secure irredundant set and obtain an inequality chain of four parameters.

Cite this paper

@inproceedings{Rashmi2016SecureDI, title={Secure Domination in Graphs}, author={S. V. Divya Rashmi and S. Arumugam and Ibrahim Venkat}, year={2016} }