On equitable near-proper coloring of some derived graph classes

Title

On equitable near-proper coloring of some derived graph classes

Creator

Jose S.; Naduvath S.

Description

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. Jose S., Naduvath S., 2022.

Source

Carpathian Mathematical Publications, Vol-14, No. 2, pp. 529-542.

Date

2022-01-01

Publisher

Precarpathian National University

Subject

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

Coverage

Jose S., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 20759827

Format

Online

Language

English

Type

Article

Identifier

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

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85146286489&doi=10.15330%2fcmp.14.2.529-542&partnerID=40&md5=d5ef99d43390f293bcc8eaa75d250b07