Connected Domination Number in Circulant Graphs
碩士 === 國立交通大學 === 應用數學系所 === 105 === Let G be a graph. A set S⊆V(G) is a connected dominating set of G if S is a dominating set of G and the subgraph induced by S is connected. The minimum size among connected dominating sets of G is the connected domination number of G, denoted by γ_c(G). For an in...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/f4vm83 |