文章基本信息

标题：Secure Domination in Graphs
本地全文：下载
作者：S.V. Divya Rashmi ; S. Arumugam ; Ibrahim Venkat 等
期刊名称：International Journal of Advances in Soft Computing and Its Applications
印刷版ISSN：2074-8523
出版年度：2016
卷号：8
期号：2
出版社：International Center for Scientific Research and Studies
摘要：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
关键词：Secure domination; Secure irredundance; Secure domination number; Upper secure domination number; Secure irredundance number; Upper secure irredundance number.