2017/08/05 by K. P. Chithra, Chithra, K. P., N. K. Sudev +7
Mathematics · #05C15 #05C75 #62A01 #FOS: Mathematics #General Mathematics (math.GM) #math.GM #msc:05C15 #msc:05C75 #msc:62A01
paper · pdf · doi:10.48550/arxiv.1708.01700
18 Pages, 2 Figures, Discrete Mathematics Algorithms and Applications, 2017
arxiv created 2017/08/16 · arxiv updated 2017/08/17
Colouring the vertices of a graph G according to certain conditions can be considered as a random experiment and a discrete random variable X can be defined as the number of vertices having a particular colour in the proper colouring of G. The concepts of mean and variance, two important statistical measures, have also been introduced to the theory of graph colouring and determined the values of these parameters for a number of standard graphs. In this paper, we discuss the colouring parameters of the Mycielskian of certain standard graphs.