5 research outputs found
Injective coloring parameters of some special classes of graphs
International audienceThe vertex coloring of a graph can be viewed as a random experiment and with respect to this experiment, a random variable X can be defined such that X denotes the color of an arbitrarily chosen vertex. In this paper, we broaden the ideas of coloring mean and variance of graphs with respect to a particular type of proper injective coloring and determine these parameters for some standard graph classes
Coloring sums of extensions of certain graphs
We recall that the minimum number of colors that allow a proper coloring of graph is called the chromatic number of and denoted . Motivated by the introduction of the concept of the -chromatic sum of a graph the concept of -chromatic sum and -chromatic sum are introduced in this paper. The extended graph of a graph was recently introduced for certain regular graphs. This paper furthers the concepts of -chromatic sum and -chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures