Super local edge antimagic total coloring of ${P}_{n}\vartriangleright H$

Super local edge anti-magic total coloring of paths and its derivation

“…The analog rises, edge local antimagic total labelings, explained by Agustin et al in [1] that includes path graph. If every vertex labels are smaller than edge labels, then it is a super local edge antimagic total labelings, which Agustin et al [2] and Kurniawati et al [7] describe in some other graph.…”

“…If both i and j are even, then i + j has smallest value attainable i + j ≥ 2 + 4 = 6, such that w(v i v j ) ≥ 3n + 1. If i = 1 and j is even, then j has smallest value attainable j ≥ 4, such that w(v i v j ) ≥ 7 2 n + 1 = 5 2 n + n + 1. If i is even and j is odd, then i + j smallest value attainable i + j ≥ 2 + 5 = 7, such that w(v i v j ) ≥ 5…”

“…It can be seen that the graph from the corollary is isomorphic with the comb product of P m with P n−1 . We revised a theorem that given by Kurniawati et al in [7].…”