Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
dominating set of a connected graph is called a neighborhood connected dominating set (ncd-set) if the induced sub-graph is connected. If the induced sub-graph is disconnected, then is called neighbourhood disconnected dominating set. In this paper we develop algorithms to find neighborhood connected dominating set and neighborhood disconnected dominating set for circular-arc graphs.