Consecutive radio labelings and the Cartesian product of graphs
For k∈{Z}+ and G a simple connected graph, a k-radio labeling f:VG→Z+ of G requires all pairs of distinct vertices u and v to satisfy |f(u)-f(v)|≥ k+1-d(u,v). When k=1, this requirement gives rise to the familiar labeling known as vertex coloring for which each ve...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
University of Iowa
2013
|
| Subjects: | |
| Online Access: | https://ir.uiowa.edu/etd/4886 https://ir.uiowa.edu/cgi/viewcontent.cgi?article=4927&context=etd |