Ara
Toplam kayıt 1, listelenen: 1-1
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. ...