Let G be a graph on vertices v1,v2, . . . ,vn. The b-chromatic number of 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â€¦ (More)

2006 International Conference on Service Systemsâ€¦

2006

Graph coloring is used to characterize some properties of graphs. A b-coloring of a graph G (using colors 1,2,...,k) is a coloring of the vertices of G such that (i) two neighbors have differentâ€¦ (More)

The irregularity strength of a simple graph is the smallest integer k for which there exists a weighting of the edges with positive integers at most k such that all the weighted degrees of theâ€¦ (More)