k-Tuple total domination in graphs
Küçük Resim Yok
Tarih
2009
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
A set S of vertices in a graph G is a k-tuple total dominating set of G if every vertex of G is adjacent to least k vertices in S. The minimum cardinality of a k-tuple total dominating set of G is the k-tuple total domination number of G. For a graph to have a k-tuple total dominating set, its minimum degree is at least k. When k = 1, a k-tuple total domination number is the well-studied total domination number. When k = 2, a k-tuple total dominating set is called a double total dominating set and the k-tuple total domination number is called the double total domination number. We determine the k-tuple total domination number for complete multipartite graphs. Upper bounds on the k-tuple total domination number of general graphs are presented.
Açıklama
Anahtar Kelimeler
total domination, k-tuple total domination
Kaynak
International Conference on Mathematical Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Kazemi, A. P. ve Henning, M. A. (2009). k-Tuple total domination in graphs. International Conference on Mathematical Sciences, Maltepe Üniversitesi. s. 40-41.
