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 …
[PDF][PDF] Perfect Roman Domination on Transformation Graphs
H Tokat, A Kırlangıç - itta.cyber.az
A dominating set in a graph 𝐺 is a set of vertices 𝑆⊆ 𝑉 (𝐺) such that any vertex of 𝑉 (𝐺)− 𝑆
is adjacent to at least one vertex of S. The minimum cardinality of a dominating set is the …
is adjacent to at least one vertex of S. The minimum cardinality of a dominating set is the …