On Certain Coloring Parameters of Graphs
Sudev Naduvath, K. P. Chithra · Zenodo (CERN European Organization for Nuclear Research) · 2019
Coloring 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 color in the proper coloring of G. In this paper, we extend the concepts of mean and variance, two important statistical measures, to the theory of graph coloring and determine the values of these parameters for a number of standard graphs.