Further results on equitable near proper coloring of derived graph families

Title

Further results on equitable near proper coloring of derived graph families

Creator

Jose S.; Naduvath S.

Description

A proper coloring assigns distinct colors to the adjacent vertices of a graph. An equitable near proper coloring of a graph G is an improper coloring in which neighbouring vertices are allowed to receive the same color such that the cardinalities of two distinct color classes differ by not more than one and the number of monochromatic edges is minimised by giving certain restrictions on the number of color classes that can have an edge between them. This paper discusses the equitable near proper coloring of line, middle, and total graphs of certain graph classes, such as paths, cycles, sunlet graphs, star graphs, and gear graphs. 2024 The Author(s). Published by Combinatorial Press.

Source

Utilitas Mathematica, Vol-121, pp. 53-68.

Date

2024-01-01

Publisher

Utilitas Mathematica Publishing Inc.

Subject

Equitable near proper coloring; Line graph; Middle graph; Total graph

Coverage

Jose S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India

Rights

Restricted Access

Relation

ISSN: 3153681

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.61091/um121-05

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85215375491&doi=10.61091%2fum121-05&partnerID=40&md5=056323ee246447ad5c3690726bcbc9f7