Skip to Main content Skip to Navigation
Journal articles

The b-chromatic number of power graphs

Abstract : 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 x_i 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958987
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 4:58:44 PM
Last modification on : Monday, March 30, 2020 - 8:51:42 AM
Document(s) archivé(s) le : Friday, June 13, 2014 - 12:08:40 PM

File

dm060104.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00958987, version 1

Citation

Brice Effantin, Hamamache Kheddouci. The b-chromatic number of power graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2003, 6 (1), pp.45-54. ⟨hal-00958987⟩

Share

Metrics

Record views

328

Files downloads

769