Algorithm to d-Distance Equitable Coloring of Tree

Prabhu, Nagarjun and Nayak, Devadas C and Dsouza, Sabitha and Rao, Ashwath B and Bhat, Pradeep G (2020) Algorithm to d-Distance Equitable Coloring of Tree. International Journal of Advanced Science and Technology, 29 (3). pp. 8320-8331. ISSN 2005-4238

[img] PDF
9048.pdf - Published Version
Restricted to Registered users only

Download (896kB) | Request a copy


The d-distance coloring of G (V, E) is an assignment of {1, 2, …, k} colors to the vertices such that any two vertices within distance d receive different colors. If the set of vertices of a graph G can be partitioned into k classes V1, V2, V3 …, Vk, such that for any, 1 ≤ i, j ≤ k, then G is said to be equitably k-colorable. In this paper, we introduce d-distance equitable coloring and obtain d-distance equitable chromatic number for cycle. Also, we present linear time an algorithm for d-distance coloring of trees and (|V|2) time an algorithm for d-distance equitable coloring

Item Type: Article
Uncontrolled Keywords: Distance Coloring, Equitable Coloring, Distance Equitable Coloring, Algorithm.
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 03 Sep 2020 08:49
Last Modified: 03 Sep 2020 08:49

Actions (login required)

View Item View Item