Distance-two constrained labeling and list-labeling of some graphs
The distance-two constrained labeling of graphs arises in the context of frequency assignment problem (FAP) in mobile and wireless networks. The frequency assignment problem is the problem of assigning frequencies to the stations of a network, so that interference between nearby stations is avoided...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
HKBU Institutional Repository
2013
|
| Subjects: | |
| Online Access: | https://repository.hkbu.edu.hk/etd_ra/1555 https://repository.hkbu.edu.hk/cgi/viewcontent.cgi?article=2553&context=etd_ra |