A Survey on Broadcast Domination Problem
碩士 === 國立清華大學 === 資訊工程學系 === 97 === A broadcast domination function on a graph $G=(V,E)$ is a function $f$ that maps $V$ into $\{0,1,\dots,k\}$ such that every vertex of $G$ within distance $f(v)$ from some vertex $v$ with $f(v)>0$. The cost of a broadcast domination function $f$ is $\Sigma_{v\in...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/44982216878959260504 |