PELABELAN TOTAL SISI TAK BERATURAN PADA GRAF GABUNGAN BIPARTIT LENGKAP
Abstract: For graph
),( EVG = , a labeling
{ }kGEGV ,,2,1)()(: K®È¶ is called an edge irregular total k labeling if
for any two different edges e and f of
)(GE , we have )()( fwew ¹ , where
)(),()()()( GExyyexew Î"¶+¶+¶= . Every graph G with the edge set
E(G) ≠ Ø has an edge irregular total k labeling by labeling all vertex with 1
and the edges with series of number 1, 2, …,
)(GE . So that the biggest label
on graph G is )(GEk = . Minimum value
k in this
edge irregular total
k labeling called
as total irregular edge
strength of the
graph G notated
by tes(G). This
research is trying
to investigate total irregular edge strength on the union disjoint of
complete bipartite graph tes(tKm,n).
The result of the
study
show that tes(tKm,n) fulfil the lower bound theorem
of tes(G).
Penulis: Triyani dan Niken
Larasati
Kode Jurnal: jpmatematikadd090061
