The 2-tuple total domination problem on Harary graphs
碩士 === 國立臺北商業大學 === 資訊與決策科學研究所 === 105 === Let G be a graph with minimum degree at least 2. A vertex subset is a 2-tuple total dominating set of G if every vertex is adjacent to at least two vertices in S. The 2-tuple total domination number of G is the minimum size of a 2-tuple total dominating set...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/654xmj |