Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
The L(2, 1)-labeling of a graph is an abstraction of the problem of assigning (integer) frequencies to radio transmitters, such that transmitters that are "close", receive different frequencies, and those that are "very close" receive frequencies that are further apart. The least...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2000
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2707/ http://shdl.mmu.edu.my/2707/1/1948.pdf |