Outer-paired Domination Problem in Block Graphs
碩士 === 國立臺灣科技大學 === 資訊管理系 === 104 === Let G = (V, E) be an undirected graph, where V(G) and E(G) are vertex and edge sets of G, respectively. For simplicity, we also use V and E to represent V(G) and E(G),respectively, when the context is clear. A set D is a dominating set of a graph G if every vert...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/94167567502148181857 |