On certain coloring parameters of Mycielski graphs of some graphs
Abstract
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. The concepts of mean and variance, two important statistical measures, have also been introduced to the theory of graph coloring and determined the values of these parameters for a number of standard graphs. In this paper, we discuss the coloring parameters of the Mycielskian of certain standard graphs.
Remember to check out the Most Cited Articles! |
---|
Be inspired by these NEW Mathematics books for inspirations & latest information in your research area! |