The total H-irregularity strength of triangular ladder and grid graphs
Rosanita Nisviasari, Dafik Dafik, Ika Hesti Agustin · Journal of Physics Conference Series · 2019
Let graph G admitting cover H . A total k -labeling can be define as total H -irregular k -labeling of the graph G if there is for every two different subgraphs H' and H " isomorphic to H . We define H -weight as which sum of vertex and edge labels in subgraph H for subgraphs under the total k -labeling . The smallest k value such that G has an H -irregular total k -labeling is the total H -irregularity strength of a graph G , is denoted tHs ( G, H ). We study the tHs of triangular ladder and grid graphs with H -covering.