On Equitable Near Proper Coloring of Mycielski Graph of Graphs

Title

On Equitable Near Proper Coloring of Mycielski Graph of Graphs

Creator

Jose S.; Naduvath S.

Description

When the available number of colors are less than that of the equitable chromatic number, there may be some edges whose end vertices receive the same color. These edges are called as bad edges. 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 resulting bad edges is minimized by restricting the number of color classes that can have adjacency among their own elements. In this paper, we investigate the equitable near-proper coloring of Mycielski graph of graphs and determine the equitable defective number of those graphs. 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

Source

Lecture Notes in Networks and Systems, Vol-290, pp. 331-339.

Date

2021-01-01

Publisher

Springer Science and Business Media Deutschland GmbH

Subject

Equitable coloring; Equitable near-proper coloring; Mycielski graph; Near-proper coloring

Coverage

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

Rights

Restricted Access

Relation

ISSN: 23673370; ISBN: 978-981164485-6

Format

Online

Language

English

Type

Conference paper

Identifier

https://doi.org/10.1007/978-981-16-4486-3_37

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85115082793&doi=10.1007%2f978-981-16-4486-3_37&partnerID=40&md5=bc64f77f939da872b4a1601ec9c5bde7