Please use this identifier to cite or link to this item:
http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/5034| Title: | Disjunctive Total Domination In Harary Graphs |
| Authors: | Ciftci, Canan Aytac, Vecdi Ordu Üniversitesi 0000-0001-5397-0367 |
| Keywords: | Domination, Disjunctive Total Domination, Harary Graph NUMBER |
| Issue Date: | 2023 |
| Publisher: | OXFORD UNIV PRESS-OXFORD |
| 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 |
| 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. |
| Description: | WoS Categories: Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods Web of Science Index: Science Citation Index Expanded (SCI-EXPANDED) Research Areas: Computer Science |
| URI: | http://dx.doi.org/10.1093/comjnl/bxac142 https://www.webofscience.com/wos/woscc/full-record/WOS:000871579600001 http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/5034 |
| ISSN: | 0010-4620 1460-2067 |
| 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.