.

ISSN 2063-5346
For urgent queries please contact : +918130348310

Neighbourhood Connected and Disconnected Domination in Circular-Arc Graphs using Algorithms

Main Article Content

Raviprakasha J1 , Dr V Ramalatha2* , Mamatha R M3
» doi: 10.48047/ecb/2023.12.10.792

Abstract

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.

Article Details