EDGE INCIDENT 2-EDGE COLORING SUM OF GRAPHS

Title

EDGE INCIDENT 2-EDGE COLORING SUM OF GRAPHS

Creator

Joseph A.; Dominic C.

Description

The edge incident 2-edge coloring number, ?ein2(G), of a graph G is the highest coloring number used in an edge coloring of a graph G such that the edges incident to an edge e = uv in G is colored with at most two distinct colors. The edge incident 2-edge coloring sum of a graph G, denoted as (Formula presented.), is the greatest sum among all the edge incident 2-edge coloring of graph G which receives maximum ?ein2(G) colors. The main objective of this paper is to study the edge incident 2-edge coloring sum of graphs and find the exact values of this parameter for some known graphs. I??k University, Department of Mathematics, 2025; all rights reserved.

Source

Turkish World Mathematical Society Journal of Applied and Engineering Mathematics, Vol-15, No. 1, pp. 98-109.

Date

2025-01-01

Publisher

Isik University

Subject

Edge incident 2-edge coloring; edge incident 2-edge coloring number; edge incident 2-edge coloring sum

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, Department of Mathematical Sciences, University of Essex, Essex, Colchester, CO4 3SQ, United Kingdom

Rights

Restricted Access

Relation

ISSN: 21461147

Format

Online

Language

English

Type

Article

Identifier

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