The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-
coloring in which every color class contains at least one vertex that has a neighbor in each …

A b-coloring of a graph G by k colors is a proper k-coloring of G such that in each color class
there exists a vertex having neighbors in all the other k− 1 color classes. The b-chromatic …

On the b-chromatic number of Kneser graphs - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each
color class contains a color dominating vertex, that is, a vertex which has a neighbor in each …

Clustering problems occur in many different fields, such as data mining processes, web
services classifications, and decompositions of large distributed systems. Let us consider the …

A vertex colouring of a graph G is called a b-colouring if each colour class contains at least
one vertex that has a neighbour in all other colour classes. The b-chromatic number b (G) of …

A proper colouring of a graph is a function that assigns a colour to each vertex with the
restriction that adjacent vertices are assigned with distinct colours. Proper colourings are a …

Let $ G $ and $ H $ be two graphs, each one of them being a path, a cycle or a star. In this
paper, we determine the $ b $-chromatic number of every subdivision-vertex neighbourhood …

Abstract Let $ G=(V, E) $ be a simple, connected and un-directed graph. Given that a map $
f: E (G)\longrightarrow\{1, 2, 3,\dots,| E (G)|\} $. We define a vertex weight of $ v\in V $ as $ w …

We consider the b-chromatic number of cartesian products of graphs. We show that the b-
chromatic number of K n□ d for d≥ 3 is one more than the degree; for d≥ 12 this follows …