| A proper k-edge coloring f of graph G(V, E) is said to be a k:-adjacent strong edge coloring of graph G(V,E) iff every uv∈E(G) satisfy f[u]≠f[v], where f[u] = {f(uw)|uw ∈E(G)} then f is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC: and x′as(G) = min{k|k-ASEC of G} is called the adjacent strong edge chromatic number. In this paper, we study the x′as(G) of Halin graphs with △?(G)≥5. |
