Neighborhood outer split domination in graphs. (4th July 2019)

• Record Type: Journal Article
• Authors: Prabha, K. Suriya; Amutha, S.; Anbazhagan, N.; Gomathi, S. Sankara
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 22:Number 5(2019)
• Page Start: 787
• Page End: 799
• Publication Date: 2019-07-04
• Subjects: 05C69; Split dominating set -- Split domination number -- Neighborhood outer split dominating set -- Neighborhood outer split domination number; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1681695
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A neighborhood outer split dominating set (nosd-set) in a graph G is a dominating set S with the property that the sub graph induced by the open neighborhood of the set S is disconnected. The minimum cardinality of vertices in such a set is called the neighborhood outer split domination number of G and it is denoted by γ n os . In this paper, we initiate a study of this parameter.