Discrete Mathematics & Theoretical Computer Science, Vol 6, No 1 (2003)

Font Size:  Small  Medium  Large

The b-chromatic number of power graphs

Brice Effantin, Hamamache Kheddouci


The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant xi adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. In this paper, we discuss the b-chromatic number of some power graphs. We give the exact value of the b-chromatic number of power paths and power complete binary trees, and we bound the b-chromatic number of power cycles.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page