Open Access Open Access  Restricted Access Subscription Access

Injective Coloring Parameters of Some Special Classes of Graphs

V. Santhosh Priya, N. K. Sudev

Abstract


Abstract

The vertex coloring of a graph can be viewed as a random experiment and with respect to this experiment, a random variable  can be defined such that  denotes the color of an arbitrarily chosen vertex. In this paper, we broaden the ideas of coloring mean and variance of graphs with respect to a particular type of proper injective coloring and determine these parameters for some standard graph classes.

MSC2010: 05C15, 05C38.

 

Keywords: Coloring mean; coloring variance; -chromatic mean; -chromatic variance; -chromatic mean; -chromatic variance.

 

Cite this Article

V. Santhosh Priya, N.K. Sudev. Injective Coloring Parameters of Some Special Classes of Graphs. Discrete Mathematical Structures. 2019; 6(2): 30–40p.


Full Text:

PDF

Refbacks

  • There are currently no refbacks.


This site has been shifted to https://stmcomputers.stmjournals.com/