On Equitable Near Proper Coloring of Certain Graph Classes

Title

On Equitable Near Proper Coloring of Certain Graph Classes

Creator

Jose S.; Naduvath S.

Description

The non-availability of sufficient number of colors to color a graph leads to defective coloring problems. Coloring a graph with insufficient number of colors cause the end vertices of some edges receive the same color. Such edges with same colored end vertices are called as bad edges. The minimum number of bad edges obtained from an equitable near proper coloring of a graph G is known as equitable defective number. In this paper, we discuss the equitable near proper coloring of some families of graphs and we also determine the equitable defective number for the same. 2022 American Institute of Physics Inc.. All rights reserved.

Source

AIP Conference Proceedings, Vol-2516

Date

2022-01-01

Publisher

American Institute of Physics Inc.

Coverage

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

Rights

All Open Access; Bronze Open Access

Relation

ISSN: 0094243X; ISBN: 978-073544234-4

Format

Online

Language

English

Type

Conference paper

Identifier

https://doi.org/10.1063/5.0108430

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85144132912&doi=10.1063%2f5.0108430&partnerID=40&md5=858784b04a4a9e13e08337656e0f0779