The study of r-locating dominating codes in paths
碩士 === 國立中山大學 === 應用數學系研究所 === 102 === The locating-dominating code of graph was introduced by Colbourn, Slater, and Stewart . Slatert proved that M^LD_1(Pn) = =⌈2n/5⌉. Honkaia proved that M^LD_2(Pn) = ⌈(n+1)/3⌉. Exoo, Junnila, and Laihonen determined M^LD_r(Pn) for (3 ≤ r ≤ 4) and (r ≥ 5 and 2 ≤ n...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23590085914690475232 |