Acerca de este artículo
Publicado en línea: 21 ene 2020
Páginas: 184 - 205
Recibido: 22 oct 2019
DOI: https://doi.org/10.2478/ausi-2019-0013
Palabras clave
© 2019 G. Anjali et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
Graph coloring can be considered as a random experiment with the color of a randomly selected vertex as the random variable. In this paper, we consider the L(2, 1)-coloring of G as the random experiment and we discuss the concept of two fundamental statistical parameters – mean and variance – with respect to the L(2, 1)-coloring of certain fundamental graph classes.