Please use this identifier to cite or link to this item: http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/2242
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCiftci, Canan-
dc.date.accessioned2022-08-17T05:20:13Z-
dc.date.available2022-08-17T05:20:13Z-
dc.date.issued2020-
dc.identifier.urihttp://doi.org/10.1002/mma.6615-
dc.identifier.urihttp://earsiv.odu.edu.tr:8080/xmlui/handle/11489/2242-
dc.description.abstractA setS subset of V(G) is a disjunctive total dominating set ofGif every vertex has a neighbor inSor has at least two vertices inSat distance two from it. The minimum cardinality of such a set is equal to the disjunctive total domination number. A non-isolating set of vertices of a graph is a set whose removal forms a graph with no isolated vertex. We define the disjunctive total domination stability ofGas the minimum size of a non-isolating set of vertices inGwhose removal changes (increases or decreases) the disjunctive total domination number. In this paper, we determine the exact values of disjunctive total domination stability of some special graphs and some trees. Moreover, we give some properties about vertices that change the disjunctive total domination number.en_US
dc.language.isoengen_US
dc.publisherWILEY, 111 RIVER ST, HOBOKEN 07030-5774, NJ USAen_US
dc.relation.isversionof10.1002/mma.6615en_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectdomination; disjunctive total domination; disjunctive total domination stabilityen_US
dc.subjectVERTEX; DIAMETERen_US
dc.titleDisjunctive total domination stability in graphsen_US
dc.typearticleen_US
dc.relation.journalMATHEMATICAL METHODS IN THE APPLIED SCIENCESen_US
dc.contributor.departmentOrdu Üniversitesien_US
dc.contributor.authorID0000-0001-5397-0367en_US
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.