# On Certain Colouring Parameters of Mycielski Graphs of Some Graphs

Source: [On Certain Colouring Parameters of Mycielski Graphs of Some Graphs](<https://www.sota2.com/research/paper/68fa54171e209131ce988a8b>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:55:43.186Z

Authors: K.P. Chithra, N.K. Sudev, S. Satheesh, K.A. Germina, Johan Kok

Published: 2017-08-05T02:25:15.000Z

## Abstract

Colouring 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 colour in the proper colouring of $G$. The concepts of mean and variance, two important statistical measures, have also been introduced to the theory of graph colouring and determined the values of these parameters for a number of standard graphs. In this paper, we discuss the colouring parameters of the Mycielskian of certain standard graphs.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1708.01700>)

[PDF](<https://arxiv.org/pdf/1708.01700.pdf>)