On the Study of Weighted Efficient Domination
博士 === 國立清華大學 === 資訊工程學系 === 86 === Given a simple graph G=(V, E), a vertex v \in V is said to dominate itself and all vertices u in V which are adjacent to v. A subset D of V is called an efficient dominating set of G if every vertex in V is dominated by...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/33141889068677802173 |