On certain coloring parameters of Mycielski graphs of some graphs
Sudev Naduvath, K. P. Chithra, K. A. Germina, Sandeep Satheesh, Johan Kok · Discrete Mathematics Algorithms and Applications · 2018
Coloring the vertices of a graph [Formula: see text] according to certain conditions can be considered as a random experiment and a discrete random variable [Formula: see text] can be defined as the number of vertices having a particular color in the proper coloring of [Formula: see text]. The concepts of mean and variance, two important statistical measures, have also been introduced to the theory of graph coloring and determined the values of these parameters for a number of standard graphs. In this paper, we discuss the coloring parameters of the Mycielskian of certain standard graphs.