A study on the injective coloring parameters of certain 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 (r.v.) X can be defined as the number of vertices having a particular color in the proper coloring of G and a probability mass function for this random variable can be defined accordingly. In this paper, we extend the concepts of mean and variance to a modified injective graph coloring and determine the values of these parameters for a number of 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! |