Please use this identifier to cite or link to this item:
http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/5034Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ciftci, Canan | - |
| dc.contributor.author | Aytac, Vecdi | - |
| dc.date.accessioned | 2024-03-26T06:27:21Z | - |
| dc.date.available | 2024-03-26T06:27:21Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.citation | Çiftçi, C., Aytaç, V. (2023). Disjunctive Total Domination In Harary Graphs. Comput. J., 66(12), 2990-2999. https://doi.org/10.1093/comjnl/bxac142 | en_US |
| dc.identifier.issn | 0010-4620 | - |
| dc.identifier.issn | 1460-2067 | - |
| dc.identifier.uri | http://dx.doi.org/10.1093/comjnl/bxac142 | - |
| dc.identifier.uri | https://www.webofscience.com/wos/woscc/full-record/WOS:000871579600001 | - |
| dc.identifier.uri | http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/5034 | - |
| dc.description | WoS Categories: Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods | en_US |
| dc.description | Web of Science Index: Science Citation Index Expanded (SCI-EXPANDED) | en_US |
| dc.description | Research Areas: Computer Science | en_US |
| dc.description.abstract | Let G be a graph. A set S of vertices in G is a disjunctive total dominating set of G if every vertex is adjacent to a vertex of S or has at least two vertices in S at distance two from it. The disjunctive total domination number, gamma(d)(t)(G), is the minimum cardinality of such a set. In this paper, we determine disjunctive total domination number of Harary graph H-k,H-n for all k and n. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | OXFORD UNIV PRESS-OXFORD | en_US |
| dc.relation.isversionof | 10.1093/comjnl/bxac142 | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Domination, Disjunctive Total Domination, Harary Graph | en_US |
| dc.subject | NUMBER | en_US |
| dc.title | Disjunctive Total Domination In Harary Graphs | en_US |
| dc.type | article | en_US |
| dc.relation.journal | COMPUTER JOURNAL | en_US |
| dc.contributor.department | Ordu Üniversitesi | en_US |
| dc.contributor.authorID | 0000-0001-5397-0367 | en_US |
| dc.identifier.volume | 66 | en_US |
| dc.identifier.issue | 12 | en_US |
| dc.identifier.startpage | 2990 | en_US |
| dc.identifier.endpage | 2999 | 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.