Year: 2017
Type: preprint
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$. In this paper, we extend the concepts of mean and variance, two important statistical measures, to the theory of graph colouring and determine the values of these parameters for a number of standard graphs.
Source: arXiv (Cornell University)
Authors: Sudev, N. K., Satheesh, S., Chithra, K. P., Kok, Johan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2621854711