On Equitable Chromatic Completion of Some Graph Classes

Title

On Equitable Chromatic Completion of Some Graph Classes

Creator

Antony T.B.; Naduvath S.

Description

An edge of a properly vertex-colored graph is said to be a good edge if it has end vertices of different color. The chromatic completion graph of a graph G is a graph obtained by adding all possible good edges to G. The chromatic completion number of G is the maximum number of new good edges added to G. An equitable coloring of a graph G is a proper vertex coloring of G such that the difference of cardinalities of any two color classes is at most 1. In this paper, we discuss the chromatic completion graphs and chromatic completion number of certain graph classes, with respect to their equitable coloring. 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

Antony T.B., 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.0108544

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85144123121&doi=10.1063%2f5.0108544&partnerID=40&md5=7ef79dc49fbea149d4f9e655a27666a1