Disjunctive Total Domination Subdivision Number of Graphs
Küçük Resim Yok
Tarih
2020
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Ios Press
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
A set S subset of V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it. the disjunctive total domination number is the minimum cardinality of a disjunctive total dominating set in G. We define the disjunctive total domination subdivision number of G as the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) to increase the disjunctive total domination number. in this paper, we first study the disjunctive total domination subdivision number of some special graphs. Next, we give some upper bounds on the disjunctive total domination subdivision number for any graphs in terms of vertex degree. Finally, we supply some conditions for a graph G to have a minimum disjunctive total domination subdivision number.
Açıklama
Anahtar Kelimeler
domination, disjunctive total domination, subdivision
Kaynak
Fundamenta Informaticae
WoS Q Değeri
Q3
Scopus Q Değeri
Q3
Cilt
174
Sayı
1
