Some improper injective coloring parameters of graphs

Title

Some improper injective coloring parameters of graphs

Creator

Pious, Merlin; Madhumitha, S.; Naduvath, Sudev

Description

Any vertex coloring protocol of a graph can be viewed as a random experiment of assigning colors to the vertices, whose random variable is defined as the number of vertices assigned a specific color in that coloring. Based on this idea, the statistical parameters of mean and variance have been extended to chromatic mean and chromatic variance for various proper vertex colorings of graphs in the literature. In this paper, the ideas of chromatic mean and chromatic variance of graphs concerning their improper injective coloring are introduced and determined for certain standard graphs. World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications;Volume;18;Issue;2;Article No.;2550026;

Date

01-01-2026

Publisher

World Scientific

Subject

chromatic mean; chromatic sum; chromatic variance; Improper coloring; injective coloring

Coverage

Pious M., Department of Mathematics, Christ University, Bangalore, India; Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India

Rights

Restricted Access; Hardcopy may be available in the library

Relation

ISSN: 17938309;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830925500260

https://www.scopus.com/pages/publications/85219118090?origin=resultslist