E-resources
-
Saha, Laxman; Panigrahi, Pratima
Discrete Applied Mathematics, 09/2015, Volume: 192Journal Article
For a positive integer k with 1⩽k⩽q, a radio k-coloring of a simple connected graph G=(V(G),E(G)) is a mapping f:V(G)→{0,1,2,…} such that |f(u)−f(v)|⩾k+1−d(u,v) for each pair of distinct vertices u,v∈V(G), where q is the diameter of G and d(u,v) is the distance between u and v. The span rck(f) of f is defined as maxu∈V(G)f(u). The radio k-chromatic number rck(G) of G is min{rck(f)} over all radio k-colorings f of G. In this paper, we give a lower bound of rck(G) for general graph G and discuss the sharpness in the particular case when k=q,q−1. In some cases we give the necessary and sufficient conditions for equality of this bound. As an application we obtain lower bounds of the radio k-chromatic number for the graphs Cn,Pm□Pn,Km□Cn,Pm□Cn and Qn. Moreover, we show that the lower bound of rck(Qn) is an improvement of the existing one.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.