On -Domination in Interval and Circle Graphs
MA Meybodi, A Poureidi - arXiv preprint arXiv:2403.04694, 2024 - arxiv.org
A subset $ S $ of vertices in a graph $ G=(V, E) $ is Dominating Set if each vertex in $ V
(G)\setminus S $ is adjacent to at least one vertex in $ S $. Chellali et al. in 2013, by …
(G)\setminus S $ is adjacent to at least one vertex in $ S $. Chellali et al. in 2013, by …