The Outer-paired Domination Problem on Proper Interval Graphs
碩士 === 國立臺灣科技大學 === 資訊管理系 === 105 === 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. For any vertex vV , the open neighborhood of v is the set NG(v) = {uV : uv E}. T...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/u853ty |