On Certain Colouring Parameters of Mycielski Graphs of Some Graphs
General Mathematics
2017-08-17 v2
Abstract
Colouring the vertices of a graph according to certain conditions can be considered as a random experiment and a discrete random variable can be defined as the number of vertices having a particular colour in the proper colouring of . 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.
Cite
@article{arxiv.1708.01700,
title = {On Certain Colouring Parameters of Mycielski Graphs of Some Graphs},
author = {K. P. Chithra and N. K. Sudev and S. Satheesh and K. A. Germina and Johan Kok},
journal= {arXiv preprint arXiv:1708.01700},
year = {2017}
}
Comments
18 Pages, 2 Figures, Discrete Mathematics Algorithms and Applications, 2017