Pelabelan Total Sisi Tak Beraturan pada Gabungan Graf Bipartit Lengkap K3,2

asmiati Dr., M.Si.

Abstract


Let G=(V,E) be a graph with V(G) is its vertex set and E(G) is its edge set. Find the minimum value of k so that all articles and edges can be labeled by 1,2,3, ..., k (labels can be repeated), and having the property that all the weights of edges on G are different. The value of k is called the edge total irregularity strength of graph G, by notation tes(G). Tes m(K3,2)=[2m+1], m is a positive integer number.

Keywords: weights of edges, edge total, irregular strength of graph

Full Text:

PDF

Refbacks

  • There are currently no refbacks.