On equitable near-proper coloring of some derived graph classes

Array

Authors

DOI:

https://doi.org/10.15330/cmp.14.2.529-542

Keywords:

equitable near-proper coloring, Mycielski graph, splitting graph, shadow graph

Abstract

An equitable near-proper coloring of a graph $G$ is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimized by restricting the number of color classes that can have adjacency among their own elements. This paper investigates the equitable near-proper coloring of some derived graph classes like Mycielski graphs, splitting graphs and shadow graphs.

Downloads

Additional Files

Published

2022-12-30

How to Cite

(1)
Jose, S.; Naduvath, S. On Equitable Near-Proper Coloring of Some Derived Graph Classes: Array. Carpathian Math. Publ. 2022, 14, 529-542.

Issue

Section

Scientific articles

Most read articles by the same author(s)