On labeling the vertices of products of complete graphs with distance constraints

D.J. Erwin, J.P. Georges and D.W. Mauro

Naval Research Logistics (NRL), 2005, vol. 52, issue 2, 138-141

Abstract: Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λj,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λj,k‐number of ∏ i=1q K t i for pairwise relatively prime integers t1

Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.10080

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:52:y:2005:i:2:p:138-141

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().