Strong chromatic index of certain nanosheets

Ganesan, Vidya; Rajasingh, Indra

doi:10.22061/jdma.2022.1933

Strong chromatic index of certain nanosheets

Document Type : Full Length Article

Authors

Vidya Ganesan ¹
Indra Rajasingh ²

¹ Research Scholar, School of Advanced Sciences, VIT University Chennai Campus, Vandalur Kelambakkam Road , Chennai 600127

² Professor, School of Advanced Sciences, VIT University Chennai Campus, Vandalur kelambakkam Road, Chennai 600127

10.22061/jdma.2022.1933

Abstract

Strong edge-coloring of a graph is a proper edge coloring such that every edge of
a path of length 3 uses three different colors. The strong chromatic index of a graph
is the minimum number k such that there is a strong edge-coloring using k colors and
is denoted by χ_s^'(G). We give efficient algorithms for strong edge-coloring of certain
nanosheets using optimum number of colors.

Graphical Abstract