IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v52y2005i2p138-141.html
   My bibliography  Save this article

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

Author

Listed:
  • D.J. Erwin
  • J.P. Georges
  • D.W. Mauro

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

Suggested Citation

  • D.J. Erwin & J.P. Georges & D.W. Mauro, 2005. "On labeling the vertices of products of complete graphs with distance constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(2), pages 138-141, March.
    • Handle: RePEc:wly:navres:v:52:y:2005:i:2:p:138-141
    DOI: 10.1002/nav.10080
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10080
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10080?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:52:y:2005:i:2:p:138-141. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.