VERTEX INDUCED 2-EDGE COLORING AND VERTEX INCIDENT 2-EDGE COLORING OF SOME GRAPH PRODUCTS

Title

VERTEX INDUCED 2-EDGE COLORING AND VERTEX INCIDENT 2-EDGE COLORING OF SOME GRAPH PRODUCTS

Creator

Joseph A.; Dominic C.

Description

Let G = (V, E) be a simple connected graph with vertex set V and edge set E. The vertex induced 2-edge coloring number ?vi2? (G) is the maximum number of colors used in coloring the edges of a graph G such that for each vertex v ? V, at most two edges in the induced subgraph ?N[v]?, generated by the closed neighborhood N[v], receive different colors. The vertex incident 2-edge coloring number ?vin2? (G) of graph G is the maximum number of colors required to color the edges of G such that at most two edges incident to a vertex v in G receive different colors. In this paper, the vertex induced 2-edge coloring number and vertex incident 2-edge coloring number of some graph products such as Cartesian product and strong product are discussed. The ?vi2?(G) and??vin2(G) number in the rooted product of a general connected graphs with some graph classes are also discussed in this paper. Palestine Polytechnic University-PPU 2022.

Source

Palestine Journal of Mathematics, Vol-11, No. 3, pp. 86-95.

Date

2022-01-01

Publisher

Palestine Polytechnic University

Subject

Cartesian product; rooted product; strong product; vertex incident 2-edge coloring number; Vertex induced 2-edge coloring number

Coverage

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

Rights

Restricted Access

Relation

ISSN: 22195688

Format

Online

Language

English

Type

Article

Identifier

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85132163181&partnerID=40&md5=1eb11558fac7ab40b0299dbd366d149f