SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.

Abstract

Coloring the vertices of a graph G according to certain condition is a random experiment and a discrete random variable X is dened as the number of vertices having a particular color in the given type of coloring of G and a probability mass function for this random variable can be dened accordingly. In this paper we extend the concepts of arithmetic mean and variance to the theory of equitable graph coloring and determine the values of these parameters.