Restrained nonsplit-[1, 2] domination number of graphs-I. (December 2018)

• Record Type: Journal Article
• Authors: Mahadevan, G; Bhagavathi Ammal, V G; Renuka, K
• Is Part Of: Journal of physics. Volume 1139(2018)
• Publication Date: 2018-12
• Subjects: [1, 2]-domination -- Restrained nonsplit domination; 05C69; Physics -- Congresses; 530.5
• DOI: 10.1088/1742-6596/1139/1/012052
• Languages: English
• ISSNs: 1742-6588

Abstract

Abstract: A restrained dominating set S ⊆ V ( G ) in a graph G is said to be restrained nonsplit-[1, 2] dominating set, if for every vertex υ ∈ V − S, 1 ≤ | N (υ) ∩ S | ≤ 2 and < V − S > is connected. The minimum cardinality of restrained nonsplit-[1, 2] dominating set ( rns [1, 2]- set ) is called restrained nonsplit-[1, 2] domination number and is denoted by γ rns [1, 2] ( G ). In this article, we launch the new concept called restrained nonsplit-[1, 2] domination number of graphs.