Please use this identifier to cite or link to this item:
http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/3444
Title: | DISJUNCTIVE TOTAL DOMINATION IN SOME GRAPHS DERIVED FROM THE SUBDIVISION GRAPH |
Authors: | Ciftci, Canan Aytac, Aysun Ordu Üniversitesi |
Keywords: | NUMBER Domination; disjunctive total domination; central graphs; middle graphs |
Issue Date: | 2021 |
Publisher: | TURKIC WORLD MATHEMATICAL SOC BAKU |
Citation: | Ciftci, C., Aytac, A. (2021). DISJUNCTIVE TOTAL DOMINATION IN SOME GRAPHS DERIVED FROM THE SUBDIVISION GRAPH. Twms Journal of Applied and Engineering Mathematics, 11(4), 1148-1157. |
Abstract: | For a set S subset of V (G), if every vertex has a neighbor in S or has at least two vertices in S at distance two from it, then the set S is a disjunctive total dominating set of G. The minimum cardinality of such a set is equal to the disjunctive total domination number. In this study, we discuss disjunctive total domination number of some graphs derived from the subdivision graphs such as middle and central graphs. |
Description: | WoS Categories : Mathematics, Applied Web of Science Index : Emerging Sources Citation Index (ESCI) Research Areas : Mathematics |
URI: | https://www.webofscience.com/wos/woscc/full-record/WOS:000704458100019 http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/3444 |
ISBN: | 2146-1147 |
Appears in Collections: | Matematik |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.