Open Access

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

G. Anjali

G. Anjali

Department of Mathematics, CHRIST (Deemed to be UniversityBangalore, India
Search for this author on
Sciendo|Google Scholar
Anjali, G.
 and 
N. K. Sudev

N. K. Sudev

Department of Mathematics, CHRIST (Deemed to be University)Bangalore, India
Search for this author on
Sciendo|Google Scholar
Sudev, N. K.
  
Jan 21, 2020
On some L(2, 1)-coloring parameters of certain graph classes's Cover Image
About this article
Previous Article
Next Article
Cite
Download Cover
Published Online: Jan 21, 2020
Page range: 184 - 205
Received: Oct 22, 2019
DOI: https://doi.org/10.2478/ausi-2019-0013
Keywords
© 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.

Language:
English
Publication timeframe:
2 times per year
Journal Subjects:
Computer Sciences, Computer Sciences, other
Journal RSS Feed