On Channel Assignment Of Graphs
碩士 === 國立嘉義大學 === 資訊工程學系研究所 === 96 === The frequency assignment problem is finding the minimum range of frequencies needed for all transmitters in the whole area. In general, a K-l(p,q) labeling for a given graph G=(V,E) with positive integers p and q where p>q , is a function f:v->{0,1,...k...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/05303810094082715476 |