多種類別圖形之支配數分割
碩士 === 國立清華大學 === 資訊工程學系 === 100 === The domatic number of a graph G = (V,E), denoted by DN(G), is the maximum number k such that V can be partitioned into k disjoint dominating sets. The domatic number problem is to find DN(G) for a graph G. The domatic partition problem is to find a partition of t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/81111541008900743222 |