Disjunctive total domination in some graphs derived from the subdivision graph

Çiftçi, Canan; Aytaç, Aysun

dc.contributor.author	Çiftçi, Canan	en_US
dc.contributor.author	Aytaç, Aysun	en_US
dc.date.accessioned	2021-11-03T16:39:09Z
dc.date.available	2021-11-03T16:39:09Z
dc.date.issued	2021
dc.identifier.citation	Çiftçi, C., Aytaç, A. (2021). Disjunctive total domination in some graphs derived from the subdivision graph. TWMS Journal Of Applied And Engineering Mathematics, 11(4), 1148-1157.	en_US
dc.identifier.issn	2146-1147
dc.identifier.issn	2587-1013
dc.identifier.uri	https://hdl.handle.net/11729/3263
dc.identifier.uri	http://jaem.isikun.edu.tr/web/index.php/archive/113-vol11-no4/772
dc.description.abstract	For a set S ⊆ 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.	en_US
dc.language.iso	en	en_US
dc.publisher	Işık University Press	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	Central graphs	en_US
dc.subject	Disjunctive total domination	en_US
dc.subject	Domination	en_US
dc.subject	Middle graphs	en_US
dc.title	Disjunctive total domination in some graphs derived from the subdivision graph	en_US
dc.type	Article	en_US
dc.description.version	Publisher's Version	en_US
dc.relation.journal	TWMS Journal Of Applied And Engineering Mathematics	en_US
dc.identifier.volume	11
dc.identifier.issue	4
dc.identifier.startpage	1148
dc.identifier.endpage	1157
dc.peerreviewed	Yes	en_US
dc.publicationstatus	Published	en_US
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı	en_US