VERTEX INDUCED k-EDGE COLORING AND VERTEX INCIDENT k-EDGE COLORING OF GRAPHS

Title

VERTEX INDUCED k-EDGE COLORING AND VERTEX INCIDENT k-EDGE COLORING OF GRAPHS

Creator

Joseph A.; Dominic C.

Description

Let k ? 2 be a natural number. Then the vertex induced k-edge coloring number ? vik(G) of a simple connected graph G = (V,E) is the highest number of colors needed to color the edges of a graph G such that the edges of the subgraph induced by the closed neighborhood N[v] of the vertex v ? V (G) receives not more than k colors. The vertex incident k-edge coloring number ? vink(G) of a simple connected graph G = (V,E) is the highest number of colors required to color the edges of a graph G such that the edges incident to a vertex v in graph G receives not more than k colors. In this paper, we initiate the study on ? vik(G) and ? vink(G). We also determine the exact values of ? vik(G) and ? vink(G) for k = 2 for some special graphs. 2023 Yarmouk University. All rights reserved.

Source

Jordan Journal of Mathematics and Statistics, Vol-16, No. 2, pp. 187-202.

Date

2023-01-01

Publisher

Yarmouk University

Subject

vertex incident 2-edge coloring number; vertex incident k-edge coloring number; vertex induced 2-edge coloring number; vertex induced k-edge coloring number

Coverage

Joseph A., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India; Dominic C., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India

Rights

Restricted Access

Relation

ISSN: 20757905

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.47013/16.2.1

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85170845794&doi=10.47013%2f16.2.1&partnerID=40&md5=761abc4e3e8e72d8fdf26940dcbde5b3