TY - JOUR

T1 - On d -distance equitable chromatic number of some graphs

AU - Prabhu, Nagarjun

AU - Nayak C, Devadas

AU - D'souza, Sabitha

AU - Bhat, Pradeep G.

N1 - Publisher Copyright:
© 2022 World Scientific Publishing Company.

PY - 2022/4/1

Y1 - 2022/4/1

N2 - An assignment of distinct colors {1, 2, 3,⋯,k} to the vertices u and v of a graph G(V,E) such that the distance between u and v is at most d is called d-distance coloring of G. Suppose C1,C2,⋯,Ck are the color classes of d-distance coloring and ||Ci|-|Cj||≤ 1 for any 1 ≤ i,j ≤ k, then G is d-distance equitable colored graph. In this paper, we obtain d-distance chromatic number and d-distance equitable chromatic number of graphs like Pm-G, Pm¯ G, Pm Pn and Pm Pn.

AB - An assignment of distinct colors {1, 2, 3,⋯,k} to the vertices u and v of a graph G(V,E) such that the distance between u and v is at most d is called d-distance coloring of G. Suppose C1,C2,⋯,Ck are the color classes of d-distance coloring and ||Ci|-|Cj||≤ 1 for any 1 ≤ i,j ≤ k, then G is d-distance equitable colored graph. In this paper, we obtain d-distance chromatic number and d-distance equitable chromatic number of graphs like Pm-G, Pm¯ G, Pm Pn and Pm Pn.

UR - http://www.scopus.com/inward/record.url?scp=85129071315&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85129071315&partnerID=8YFLogxK

U2 - 10.1142/S1793557122500759

DO - 10.1142/S1793557122500759

M3 - Article

AN - SCOPUS:85129071315

VL - 15

JO - Asian-European Journal of Mathematics

JF - Asian-European Journal of Mathematics

SN - 1793-5571

IS - 4

M1 - 2250075

ER -