Ara
Toplam kayıt 2, listelenen: 1-2
Doubly connected pitchfork domination and it’s inverse in graphs
(Işık University Press, 2022)
Let G be a finite, simple, undirected graph and without isolated vertices. A subset D of V is a pitchfork dominating set if every vertex v ∈ D dominates at least j and at most k vertices of V − D, for any j and k integers. ...
Changing and unchanging on Tadpole domination number in G − e, G + e graphs
(Işık University Press, 2022)
In this paper, the effect of “Tadpole domination” change is examined, which is one of the domination types, when a graph is modified, by deleting or adding an edge in G. This edge deletion may represent a cut in a network. ...