A Study on the Double Total Domination Problem in Harary Graphs
| Autor: | Chia-Wen Wu, 吳嘉雯 |
|---|---|
| Rok vydání: | 2019 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 107 Let G = (V, E) be a graph with minimum degree at least 2. A vertex subset D is a double total dominating set of G if every vertex of G is adjacent to at least two vertices in D. The double total domination number of G, denoted as γ×2,t(G), is the size of a minimum double total dominating set in G. In this thesis, we are concerned with the double total domination number of the Harary graph H_(2m+1,2n), where 2m + 1 is the degree of each vertex and 2n is the number of vertices. Let 2n = (2m+1)l+r, where 0 |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|