Algorithm to d-distance equitable coloring of trees

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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 ||Vi|-|Vj|| 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 (Formula Presented) time an algorithm for d-distance equitable coloring.

Original languageEnglish
Pages (from-to)2140-2150
Number of pages11
JournalInternational Journal of Advanced Science and Technology
Issue number5
Publication statusPublished - 10-04-2020

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • General Engineering
  • General Energy


Dive into the research topics of 'Algorithm to d-distance equitable coloring of trees'. Together they form a unique fingerprint.

Cite this