Open AccessThe total H-irregularity strength of triangular ladder graphs
Author(s) -
Rosanita Nisviasari,
Dafik Dafik,
Ika Hesti Agustin
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1465/1/012026
Subject(s) - combinatorics , mathematics , graph , vertex (graph theory) , bound graph , edge graceful labeling , induced subgraph , graph power , discrete mathematics , line graph
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 H j , 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.