@article{Nanda_Hasmawati_Nur_2023, title={Partition Dimention of Amalgamation-Side in Cycle Graph}, volume={20}, url={https://journal.unhas.ac.id/index.php/jmsk/article/view/26808}, DOI={10.20956/j.v20i1.26808}, abstractNote={<p><em>The graph </em> <em> is a pair of sets </em> <em>, where </em> <em> is a finite set whose elements are called vertices, and </em> <em> is the set of pairs of members of </em> <em>. which is called the edge. Let </em> <em> be a simple graph where </em> <em>. The distance between points </em> <em> and </em> <em> is denoted by </em> <em> is the length of the shortest path between </em> <em> and </em> <em>. Given </em> <em> and there is a vertex </em> <em> on the connected graph </em> <em>, then the distance between </em> <em> and </em> <em> is denoted</em> . If <em> is </em> <em>-partition of </em> <em>, then the representation of </em> <em> with respect to is </em> <em>-ordered pairs, </em> . <em>If the </em> <em>-ordered pairs </em> <em> for </em> <em> are all different, then the partition is called a dimension partition. The minimal </em> <em>-number which is the </em> <em>-differentiating partition of </em> <em> is called the partition dimension of </em> <em> and is denoted by </em> <em>. In this study, the partition dimensions of the sided amalgamation result will be determined on an even-order cycle graph. In determining the dimensions of the partition, characterization of the partition dimensions is used in the path graph, the lemma about the distinguishing set and the equivalence point, especially in the even-order cycle graph. The results of this study are</em> pd(Amal(Cn,e,k)) = 3 <em>for n≥4</em> , pd(Amal(C4,e,k))=4 <em>for</em> k=4 , pd(Amal(C4,e,k))=3+m for k=2m+3 and k=2m+4 where m=1,2,3,...</p>}, number={1}, journal={Jurnal Matematika, Statistika dan Komputasi}, author={Nanda, Ananda Dwi Nabila and Hasmawati, Hasmawati and Nur, Muh.}, year={2023}, month={Sep.}, pages={65-74} }