Main Article Content

Abstract

Given that G is a simple and connected graph with a set of points and sides, that is, denoted  and  respectively. The labeling –k total of irregular edges of graph G is that each edge has a different weight. The smallest k value contained in the labeling -k total irregular edges is called the irregular strength of the total side of G which is denoted by the test (G). In this paper, the author examines the irregular strength of the total side of the bag graph and the temple graph. The bag graph is denoted by Ts (n) with the test value  and the temple graph is denoted by Pu (n) with the test value

Keywords

irregular side total labeling, bag graf, pura graf

Article Details

Author Biography

Sauki

Universitas Sulawesi Barat

References

  1. [1] Wilson, J. Robin., Introduction to Graph Theory, 4th Edition. London: Addison Wesley Longman Limited, 1998.
  2. [2] M. Bac ̆a, S. Jendrol', dan J. Ryan, “On Irregular Total Labelling,” Discrete Math., vol. 307, pp. 1378–1388, 2007.
  3. [3] J. A. Gallian, A Dynamic Survey of Graph Labelling, Electron, J, Combin., 2016.
  4. [4] S. Jendrol', J. Miskuf, R. Sotak, “Total Edge Irregularity Strength of Complete and Complete Bipartite Graphs,” in Notes Discrete Math, vol. 28. 2017, pp. 281285.