Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/12731
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKola, S.R.
dc.contributor.authorPanigrahi, P.
dc.date.accessioned2020-03-31T08:42:03Z-
dc.date.available2020-03-31T08:42:03Z-
dc.date.issued2015
dc.identifier.citationElectronic Notes in Discrete Mathematics, 2015, Vol.48, , pp.289-296en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12731-
dc.description.abstractRadio coloring of a graph G with diameter d is an assignment f of positive integers to the vertices of G such that |f(u)-f(v)|?1+d-d(u,v) where u and v are any two distinct vertices of G and d(u,v) is the distance between u and v. The number max {f(u): u? V(G)} is called the span of f. The minimum of spans over all radio colorings of G is called the radio number of G, denoted by rn(G). An m-distant tree T is a tree in which there is a path P of maximum length such that every vertex in V(T) \ V(P) is at most distance m from P. This path P is called a central path. Every tree can be represented as an m-distant tree for some non-negative integer m. In this paper, we find the radio number of a class of 1-distant trees (or caterpillars). 2015 Elsevier B.V.en_US
dc.titleRadio Numbers of Some Caterpillarsen_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.