On Channel Assignment Of Regular Graphs
碩士 === 國立嘉義大學 === 資訊工程學系研究所(Graduate School of Computer Scie === 98 === The channel assignment problem which was modeled by graphs was introduced by Hale in 1980. They used the vertices to denote the transmitters and the edges to indicate two transmitters being “very closed”. A k-L(2,1) labeling f...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/84175782045294494603 |