The strong chromatic index of Halin graphs

A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if their distance is at most two. The strong chromatic index of a graph G, denoted by [email protected]^'(G), is the minimum number of colors needed for a strong edge coloring of G. A Halin graph G is a plane graph constructed from a tree T without vertices of degree two by connecting all leaves through a cycle C. If a Halin graph [email protected]?C is different from a certain necklace Ne"2 and any wheel W"n, [email protected]?0(mod3), then we prove that [email protected]^'(G)=