Some new results on equitable coloring parameters of graphs
- Title
- Some new results on equitable coloring parameters of graphs
- Creator
- Sudev N.
- Description
- An equitable coloring of a graph G is a proper vertex coloring C of G such that the cardinalities of any two color classes in G with respect to C differ by at most one. Coloring the vertices of a graph G subject to given conditions can be considered as a random experiment. In this context, a discrete random variable X can be defined as the color of a vertex chosen at random, with respect to the given type of coloring of G and a probability mass function for this random variable can be defined accordingly. In this paper, we discuss two statistical parameters of the powers of certain graph classes with respect to their equitable colorings. 2019, Univerzita Komenskeho. All rights reserved.
- Source
- Acta Mathematica Universitatis Comenianae, Vol-89, No. 1, pp. 109-122.
- Date
- 2019-01-01
- Publisher
- Univerzita Komenskeho
- Subject
- Coloring mean; Coloring variance; Graph coloring; ?e-chromatic mean; ?e-chromatic variance
- Coverage
- Sudev N., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, 560029, Karnataka, India
- Rights
- Restricted Access
- Relation
- ISSN: 8629544
- Format
- Online
- Language
- English
- Type
- Article
Collection
Citation
Sudev N., “Some new results on equitable coloring parameters of graphs,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 26, 2025, https://archives.christuniversity.in/items/show/16762.