A Study of Disjunctive Total Domination Problem on Trees
碩士 === 國立東華大學 === 資訊工程學系 === 104 === For a graph G = (V; E), D ⊆ V is a dominating set if every vertex in V \ D has a neighbor in D. If every vertex in V has to be adjacent to a vertex of D, then D is called a total dominating set of G. The (total) domination problem on G is to nd a (total) dominat...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/83552645429406426721 |