The Domination and Bondage Numbers of Paths and Cycles
碩士 === 國立臺灣科技大學 === 資訊管理系 === 90 === Let u and v be two vertices in a simple graph G=(V,E), where V and E are the vertex and edge, respectively, sets of G. We say that u k-dominates v if their distance is less than or equal to k. A subset D of V is called a k-dominating set of G if for ev...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24600537879790177072 |