Please use this identifier to cite or link to this item:
http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/3351
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ciftci, Canan | - |
dc.date.accessioned | 2023-01-06T10:34:15Z | - |
dc.date.available | 2023-01-06T10:34:15Z | - |
dc.date.issued | 2021 | - |
dc.identifier.citation | Ciftci, C. (2021). Complexity and bounds for disjunctive total bondage. Theoretical Computer Science, 865, 44-51.Doi:10.1016/j.tcs.2021.02.032 | en_US |
dc.identifier.isbn | 0304-3975 | - |
dc.identifier.isbn | 1879-2294 | - |
dc.identifier.uri | http://dx.doi.org/10.1016/j.tcs.2021.02.032 | - |
dc.identifier.uri | https://www.webofscience.com/wos/woscc/full-record/WOS:000634961700004 | - |
dc.identifier.uri | http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/3351 | - |
dc.description | WoS Categories : Computer Science, Theory & Methods Web of Science Index : Science Citation Index Expanded (SCI-EXPANDED) Research Areas : Computer Science | en_US |
dc.description.abstract | A subset S subset of V(G) is a disjunctive total dominating set if each vertex has a neighbor in S or has at least two vertices in Sat distance two from it. The disjunctive total domination number gamma(d)(t)(G) is the minimum cardinality of a disjunctive total dominating set in G. Disjunctive total bondage number, b(t)(d)(G), of a graph G with no isolated vertex is defined as the minimum cardinality of edge set B subset of E(G) whose deletion obtains a graph G - B with no isolated vertex satisfying gamma(d)(t)(G - B) > gamma(d)(t)(G). If there is no such set B, it is then defined as b(t)(d)(G) = infinity. We, in this paper, present some bounds on disjunctive total bondage. Also, we prove that the disjunctive total bondage problem is NP-complete, even for bipartite graphs. (C) 2021 Elsevier B.V. All rights reserved. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | ELSEVIER AMSTERDAM | en_US |
dc.relation.isversionof | 10.1016/j.tcs.2021.02.032 | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | TOTAL DOMINATION; RESTRAINED BONDAGE; NUMBER | en_US |
dc.subject | Disjunctive total domination; Disjunctive total bondage; Complexity; NP-completeness | en_US |
dc.title | Complexity and bounds for disjunctive total bondage | en_US |
dc.type | article | en_US |
dc.relation.journal | THEORETICAL COMPUTER SCIENCE | en_US |
dc.contributor.department | Ordu Üniversitesi | en_US |
dc.identifier.volume | 865 | en_US |
dc.identifier.startpage | 44 | en_US |
dc.identifier.endpage | 51 | en_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.