E-resources
-
Saha, Laxman
AKCE international journal of graphs and combinatorics, 01/2020, Volume: ahead-of-print, Issue: ahead-of-printJournal Article
For a simple connected graph and a positive integer with , a radio -coloring of is a mapping such that holds for each pair of distinct vertices and of , where is the diameter of and is the distance between and in . The span of a radio -coloring is the number . The main aim of the radio -coloring problem is to determine the minimum span of a radio -coloring of , denoted by . Due to NP-hardness of this problem, people are finding lower bounds for for particular families of graphs or general graphs . In this article, we concentrate on finding upper bounds of radio -chromatic number for general graphs and in consequence a coloring scheme depending on a partition of the vertex set . We apply these bounds to cycle graph and hypercube and show that it is sharp when is close to the diameter of these graphs.
Author
![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.