Neighborhood Triple Connected Two- Out Degree Equitable Domination Number
Iosr Journals, M. S. Mahesh, P. Namasivayam · Figshare · 2015
In this paper we introduce a new domination parameter with real life application called neighborhood triple connected two out degree equitable domination number of a graph. A subset D of V of a nontrivial graph G is said to be a neighborhood triple connected two out degree equitable dominating set if D is a two out degree equitable dominating set and the induced sub graph is triple connected. The minimum cardinality taken over all neighborhood triple connected two out degree equitable dominating set is called neighborhood triple connected two out degree equitable domination number and is denoted by γntc 2oe (G) We investigate this number for some standard graphs and special graphs