@article{Hasmawati_Daming_Haryanto_Nurwahyu_2019, title={Dimensi Partisi Graf Hasil Amalgamasi Siklus}, volume={16}, url={https://journal.unhas.ac.id/index.php/jmsk/article/view/8062}, DOI={10.20956/jmsk.v16i2.8062}, abstractNote={<p>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 <em>k</em> 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. </p>}, number={2}, journal={Jurnal Matematika, Statistika dan Komputasi}, author={Hasmawati, Hasmawati and Daming, Ahmad Syukur and Haryanto, Loeky and Nurwahyu, Budi}, year={2019}, month={Dec.}, pages={199-207} }