Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7625
Title: | A Graph Labeling Problem Suggested by FM Channel Restrictions |
Authors: | Gary Chartrand David Erwin |
Issue Date: | 2005 |
Publisher: | Bulletin of the Institute of Combinatorics and Its Applications |
Abstract: | radio labeling of a connected graph G is an assignment c of distinct positive integers to the vertices of G such that d(u, v) + lc(u) - c(v)I ~ 1 + diam(G) for every two distinct vertices u , v of G, where d(u, v) denotes the distance between u and v and diam( G) is the diameter of G. The radio number rn (c) of a radio labeling of G is the maximum label assigned to a vertex of G. The radio number rn( G) of G is min{rn(c)} over all radio labelings c of G. |
URI: | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7625 |
Appears in Collections: | Articles to be qced |
Files in This Item:
File | Size | Format | |
---|---|---|---|
A Graph Labeling Problem SUggested by FM Channel.pdf Restricted Access | 3.79 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.