<![CDATA[In this paper, there is a section that identifies the aim of the research and makes it possible to suggest exploring the metric dimension and partition dimension of the amalgamation of complete graphs, which we would denote as Amal(Kn, v0)t. There are three steps conducted to achieve the research goals in this paper. To begin with, compute the lower bound of the metric dimension and the partition dimension of the graph Amal(Kn, v0)t. The second step is to find the upper bounds of the metric dimension and partition dimension of the graph Amal(Kn, v0)t by demonstrating that the representation of any vertex in Amal(Kn, v0)t is distinct. Finally, the exact values of the metric dimension and partition dimension of the graph Amal(Kn, v0)t are found if the lower and upper bounds are determined. The exact value of the metric dimension of the graph Amal(Kn, v0)t is denoted as dim(Amal(Kn, v0)t), while the exact value of the partition dimension is denoted as pd(Amal(Kn, v0)t). In this research, it is found that dim(Amal(Kn, v0)t) = (n - 2) for n, t ϵ N with n ≥ 3 and t ≥ 2. It is also found that pd(Amal(Kn, v0)t) = n for 2 ≤ t ≤ Cnn-1.]]>
Copyrights © 2025
