On domination numbers of directed tori
碩士 === 國立臺北商業技術學院 === 資訊與決策科學研究所 === 99 === A dominating set in a graph G is a set S of vertices having the property that every vertex is either in S or dominated by S. The domination number (G) of G is the cardinality of a smallest dominating set in G. The dominating set problem concerns testing wh...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/87837262742356634342 |