Chromatic Zagreb and irregularity polynomials of graphs

Title

Chromatic Zagreb and irregularity polynomials of graphs

Creator

Rose S.; Naduvath S.

Description

Graph coloring is an assignment of colors, labels or weights to elements of a graph subject to certain constraints. Coloring the vertices of a graph in such a way that adjacent vertices are having different colors is called proper vertex coloring. A proper vertex coloring using minimum parameters of colors is studied extensively in recent literature. In this paper, we define new coloring related polynomials, called chromatic Zagreb polynomials and chromatic irregularity polynomials, in terms of minimal parameter coloring and structural characteristics of graphs such as distances and degrees of vertices. 2021 World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications, Vol-13, No. 5

Date

2021-01-01

Publisher

World Scientific

Subject

chromatic irregularity polynomials; chromatic Zagreb polynomials; Graph coloring; minimal parameter coloring

Coverage

Rose S., Department of Mathematics, Christ (Deemed to Be University), Bengaluru, India; Naduvath S., Department of Mathematics, Christ (Deemed to Be University), Bengaluru, India

Rights

Restricted Access

Relation

ISSN: 17938309

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830921500610

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85098589260&doi=10.1142%2fS1793830921500610&partnerID=40&md5=15c5937c1b32e1aacf828aba555c4fad