Strong chromatic index of certain nanosheets

نویسندگان

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

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

doi
10.22061/jdma.2022.1933
چکیده

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