Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNiranjan, P.K.
dc.contributor.authorKola, S.R.
dc.identifier.citationAKCE International Journal of Graphs and Combinatorics, 2019, Vol.16, 2, pp.230-235en_US
dc.description.abstractFor any positive integer k, a k-distance coloring of a graph G is a vertex coloring of G in which no two vertices at distance less than or equal to k receive the same color. The k-distance chromatic number of G, denoted by ?kG is the smallest integer ? for which G has a k-distance ?-coloring. In this paper, we improve the lower bound for the k-distance chromatic number of an arbitrary graph for k odd case and see that trees achieve this lower bound by determining the k-distance chromatic number of trees. Also, we find k-distance chromatic number of cycles and 2-distance chromatic number of a graph G in which every pair of cycles are edge disjoint. 2017 Kalasalingam Universityen_US
dc.titleThe k-distance chromatic number of trees and cyclesen_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.