Accès libre

On some L(2, 1)-coloring parameters of certain graph classes

À propos de cet article

Citez

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.

eISSN:
2066-7760
Langue:
Anglais
Périodicité:
2 fois par an
Sujets de la revue:
Computer Sciences, other