Dimensi Partisi Graf Hasil Amalgamasi Siklus


  • Hasmawati Hasmawati Hasanuddin University
  • Ahmad Syukur Daming
  • Loeky Haryanto
  • Budi Nurwahyu




Dimensi Partisi


Let be a connected graph G and -partition  of  end . The coordinat  to  is definition . If   for every two vertices in t , then  is a called  k-resolving partition of . The minimum k such that  is a k-resolving partition of  is the partition dimension of  and denoted by . In this paper, we show that the partition dimension for amlagamation of cycle graph  for To proof this results, we was used mathematical induction method. 


Asmiati. 2012. Partition Dimension of Amalgamation of Stars. Bulletin of Mathematics. 02(04): 161-167.

Asmiati. 2016. Dimensi Partisi Graf Amalgamasi Bintang yang Dihubungkan Suatu Lintasan. Jurnal Matematika, Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Lampung. 19(3): 93-95.

Chartrand, G., dan Oellermann, O. R. 1993. Applied and Algorithmic graph Theory. McGraw–Hill, Inc, New York–St. Louis–San Francisco.

Chartrand, G., Salehi, E., dan Zang, P. 1998. On The Partition Dimension of Graph. Congressus Numerantium. Vol. 130: 157-168.

Chartrand, G., Salehi, E., dan Zang, P. 2000. The Partition Dimension of Graph. Aequationes Mathematicae. 59: 45-54.

Darmaji. 2011. Dimensi Partisi Graf Multipartit dan Graf Hasil Korona Dua Graf Terhubung. Disertasi. Bandung: Institut Teknologi Bandung, Indonesia.

Diestel R. 2005. Graph Theory, Third Edition. Springer-Verlag Heidelberg. New York.

Fitriani, D., Salman, A. N. M. 2016. Rainbow connection number of amalgamation of some graphs. AKCE International journal of graphs and combinatorics. 13 : 90–99.

Juan, R., Yero, I. G., dan Lemanska, M. 2014. On the Partition Dimension of Trees. Discrete Applied Mathematics. 166: 204-209.






Research Articles