arXiv · 1708.01700
On Certain Colouring Parameters of Mycielski Graphs of Some Graphs
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
K. P. Chithra, N. K. Sudev, S. Satheesh, K. A. Germina, Johan Kok. 2017-08-16. On Certain Colouring Parameters of Mycielski Graphs of Some Graphs. https://arxiv.org/abs/1708.01700
Cite the original work for its findings. Save a collection to share your selection of sources.