k-Tuple total domination in graphs

Basit Öğe Kaydı
dc.contributor.authorKazemi, A. P.
dc.contributor.authorHenning, M. A.
dc.date.accessioned2024-07-12T20:56:17Z
dc.date.available2024-07-12T20:56:17Z
dc.date.issued2009en_US
dc.departmentMaltepe Üniversitesi, İnsan ve Toplum Bilimleri Fakültesien_US
dc.description.abstractA 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.en_US
dc.identifier.citationKazemi, A. P. ve Henning, M. A. (2009). k-Tuple total domination in graphs. International Conference on Mathematical Sciences, Maltepe Üniversitesi. s. 40-41.en_US
dc.identifier.endpage41en_US
dc.identifier.isbn9.78605E+12
dc.identifier.startpage40en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2956
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference on Mathematical Sciencesen_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY07893
dc.subjecttotal dominationen_US
dc.subjectk-tuple total dominationen_US
dc.titlek-Tuple total domination in graphsen_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu