2017/06/03 by N. K. Sudev, S. Satheesh, Sudev, N. K. +5 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Advanced Graph Theory Research #Color Science and Applications #math.GM #msc:05C15 #msc:62A01
paper · pdf · doi:10.48550/arxiv.1706.02547
11 Pages
arxiv created 2017/06/03 · arxiv updated 2017/06/09
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.