Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/12381
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNiranjan, P.K.
dc.contributor.authorKola, S.R.
dc.date.accessioned2020-03-31T08:39:07Z-
dc.date.available2020-03-31T08:39:07Z-
dc.date.issued2020
dc.identifier.citationInternational Journal of Applied and Computational Mathematics, 2020, Vol.6, 2, pp.-en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12381-
dc.description.abstractRadio k-coloring of a graph G is an assignment f of positive integers (colors) to the vertices of G such that for any two distinct 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 the largest number assigned by f. The radio k-chromatic number rck(G) is min{rck(f):fis a radiok-coloring ofG}. When k= diam(G) , f is called a radio coloring of G and the corresponding radio k-chromatic number is known as the radio number of G. In this paper, we determine the radio number of some classes of trees. Also, we find the radio d-chromatic number of infinitely many trees and graphs of arbitrarily large diameter constructed from trees of diameter d in some subclasses of the above classes. 2020, Springer Nature India Private Limited.en_US
dc.titleOn the Radio k-chromatic Number of Some Classes of Treesen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.