On Certain Colouring Parameters of Graphs
General Mathematics
2017-06-09 v1
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 . 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.
Keywords
Cite
@article{arxiv.1706.02547,
title = {On Certain Colouring Parameters of Graphs},
author = {N. K. Sudev and S. Satheesh and K. P. Chithra and Johan Kok},
journal= {arXiv preprint arXiv:1706.02547},
year = {2017}
}
Comments
11 Pages