Further results on secure restrained domination in graphs. (3rd March 2016)

• Record Type: Journal Article
• Authors: Pushpam, P. Roushini Leely; Suseendran, Chitra
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 2(2016)
• Page Start: 277
• Page End: 291
• Publication Date: 2016-03-03
• Subjects: Restrained domination -- Secure domination -- Secure restrained domination; 05C69; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2014.1001590
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: Let G =( V, E ) be a graph and let S ⊆ V. The set S is a dominating set of G if every vertex in V \ S is adjacent to some vertex in S . The set S is a restrained dominating set if every vertex in V \ S is adjacent to a vertex in S and to a vertex in V \ S . The minimum cardinality of a restrained dominating set is called restrained domination number of G and it is denoted by γ r ( G ). A set S ⊆ V ( G ) is called a secure (restrained) dominating set if S is (restrained) dominating and for all u ϵ V \ S there exists v ϵ S ∩ N ( u ) such that ( S \ { v }) ∪ { u } is (restrained) dominating. The minimum cardinality of a secure (restrained) dominating set is a secure (restrained) domination number of G and it is denoted by γ s ( G ) (γ sr ( G )). In this paper we characterize few classes of graphs for which γ r ( G )=γ sr ( G ) and γ s ( G )=γ sr ( G ). Specific values of certain graphs are determined and Nordhaus Gaddum type results are discussed.