Coloring the vertices of a graph [Formula: see text] subject to given conditions can be considered as a random experiment and corresponding to this experiment, a discrete random variable [Formula: see text] can be defined as the color of a vertex chosen at random, with respect to the given type of coloring of [Formula: see text] and a probability mass function for this random variable can be defined accordingly. A proper coloring [Formula: see text] of a graph [Formula: see text], which assigns colors to the vertices of [Formula: see text] such that the numbers of vertices in any two color classes differ by at most one, is called an equitable coloring of [Formula: see text]. In this paper, we study two statistical parameters of certain graphs, with respect to their equitable colorings.
Discussion(0)
No comments yet. Be the first to comment.