Ara
Toplam kayıt 2, listelenen: 1-2
Disjunctive total domination in some graphs derived from the subdivision graph
(Işık University Press, 2021)
For a set S ⊆ V (G), if every vertex has a neighbor in S or has at least two vertices in S at distance two from it, then the set S is a disjunctive total dominating set of G. The minimum cardinality of such a set is equal ...
Algorithmic complexity of isolate secure domination in graphs
(Işık University Press, 2021)
A dominating set S is an Isolate Dominating Set (IDS) if the induced subgraph G[S] has at least one isolated vertex. In this paper, we initiate the study of new domination parameter called, isolate secure domination. An ...