A Study of Weighted Paired-Domination on Some Graph Classes
碩士 === 世新大學 === 資訊管理學研究所(含碩專班) === 102 === For a graph G(V, E), a matching is a set of pairwise nonadjacent edges of G. A perfect matching M of G is a matching such that every vertex of G is incident to only one edge of M. A paired dominating set is a vertex-set S of G such that every vertex in V −...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/99011580254781546940 |