On equitable near proper coloring of graphs

Title

On equitable near proper coloring of graphs

Creator

Jose S.; Samuel L.C.; Naduvath S.

Description

A defective vertex coloring of a graph is a coloring in which some adjacent vertices may have the same color. An edge whose adjacent vertices have the same color is called a bad edge. A defective coloring of a graph G with minimum possible number of bad edges in G is known as a near proper coloring of G. In this paper, we introduce the notion of equitable near proper coloring of graphs and determine the minimum number of bad edges obtained from an equitable near proper coloring of some graph classes. 2024 Azarbaijan Shahid Madani University.

Source

Communications in Combinatorics and Optimization, Vol-9, No. 1, pp. 131-143.

Date

2024-01-01

Publisher

Azarbaijan Shahid Madani University

Subject

equitable coloring; equitable near proper coloring; Improper coloring; near proper coloring

Coverage

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

Rights

Restricted Access

Relation

ISSN: 25382128

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22049/CCO.2022.27240.1218

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85187251230&doi=10.22049%2fCCO.2022.27240.1218&partnerID=40&md5=0fb6c94ed78f20a527c8bc32a3851563