Upper bound for radio -chromatic number of graphs in connection with partition of vertex set
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 pro...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.03.024 |