Open AccessThe Split Distance 2 Domination in Graphs
Author(s) -
A. Renuka Lakshmi,
K. Ameenal Bibi,
R. Jothilakshmi
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.10.21289
Subject(s) - dominating set , mathematics , combinatorics , domination analysis , graph , cardinality (data modeling) , discrete mathematics , vertex (graph theory) , computer science , data mining
A distance - 2 dominating set D V of a graph G is a split distance - 2 dominating set if the induced sub graph is disconnected. The split distance - 2 domination number is the minimum cardinality of a split distance - 2 dominating set. In this paper, we defined the notion of split distance - 2 domination in graph. We got many bounds on distance - 2 split domination number. Exact values of this new parameter are obtained for some standard graphs. Nordhaus - Gaddum type results are also obtained for this new parameter.