The total H-irregularity strength of triangular ladder graphs
Rosanita Nisviasari, Dafik Dafik, Ika Hesti Agustin · Journal of Physics Conference Series · 2020
Abstract Let G be a graph which has V(G) as a vertex set and E(G) as an edge set. The G graph contain subgraph H that isomorphic with Hj, j = 1, 2, … s, if every e ∈ E(G) include only in one of the edge set of H subgraph (e ∈ E(H)). The total l-labeling is a graph labeling that give label positive integer number until l into vertices and edges. The total H-irregular labeling is a total l-labeling with condition that the sum of vertex labels and edge labels in two distinct subgraphs H 1 and H 2 isomorphic to H is different. We define H-weight as wtφ (H) = ∑ v∈V(H) φ(v) + ∑ e∈E(H) φ(e), for the subgraph H ⊆ G under the total l-labeling (φ). The total H-irregularity strength of G graph (ths(G, H)) is the smallest l value in label of G graph has total H-irregular labeling. We used plane graphs such as triangular ladder graph and windmill graph.