On the Radio k-chromatic Number of Paths
| dc.contributor.author | Niranjan, P.K. | |
| dc.contributor.author | Kola, S.R. | |
| dc.date.accessioned | 2026-02-04T12:28:26Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | A radio k-coloring of a graph G is an assignment f of positive integers (colors) to the vertices of G such that for any two vertices u and v of G, the difference between their colors is at least 1 + k - d(u, v). The span rck(f) of f is (Formula Presented). The radio k-chromatic number (Formula Presented). In this paper, in an attempt to prove a conjecture on the radio k-chromatic number of path, we determine the radio k-chromatic number of paths P<inf>n</inf> for (Formula Presented) if k is odd and (Formula Presented) if k is even. © 2022 Università del Salento | |
| dc.identifier.citation | Note di Matematica, 2022, 42, 1, pp. 37-45 | |
| dc.identifier.issn | 11232536 | |
| dc.identifier.uri | https://doi.org/10.1285/i15900932v42n1p37 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/22742 | |
| dc.publisher | University of Salento | |
| dc.subject | Radio coloring | |
| dc.subject | Radio k-chromatic number | |
| dc.subject | Radio k-coloring | |
| dc.subject | Radio number | |
| dc.title | On the Radio k-chromatic Number of Paths |