Paired Domination in Distance-Hereditary Graphs
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 105 === A vertex subset D of a graph G is a dominating set if every vertex not in D is adjacent to at least a vertex in D; besides, if the subgraph of G induced by D has a perfect matching, then D is a paired dominating set. The paired domination problem is to find the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/y8ty53 |