On Certain Colouring Parameters of Mycielski Graphs of Some Graphs
K.P. Chithra, N.K. Sudev, S. Satheesh, K.A. Germina, Johan Kok

TL;DR
This paper investigates the statistical properties of vertex colourings in Mycielski graphs derived from standard graphs, focusing on mean and variance of colour distributions.
Contribution
It introduces the analysis of colouring parameters, specifically mean and variance, for the Mycielski graphs of certain standard graphs, extending previous graph colouring studies.
Findings
Calculated mean and variance of colour distributions for Mycielski graphs.
Extended statistical graph colouring concepts to Mycielski constructions.
Provided new insights into colouring parameters of complex graph classes.
Abstract
Colouring the vertices of a graph according to certain conditions can be considered as a random experiment and a discrete random variable can be defined as the number of vertices having a particular colour in the proper colouring of . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Limits and Structures in Graph Theory
