<![CDATA[This study discusses the analysis of the partition dimension of the graph resulting from the edge amalgamation between the wheel graph ( Wn) and the star graph ( Sm), where the partition dimension is an important parameter in graph theory that serves to measure the minimum number of partitions required to distinguish every pair of vertices through a set of supporting vertices. The amalgamation process is carried out by merging one edge of the wheel graph with one edge of the star graph, thus forming a new graph. This research employs theoretical and algorithmic approaches to calculate the partition dimension of the resulting amalgamated graph, focusing on the influence of the number of vertices in both constituent graphs on the changes in the partition dimension. The results show that pd(amal_s(Wn,Sm;v1v2,u1u2))=3 when 4n7 and m=3, and 4 when n=3 and 3≤m≤4, whereas if n≥8 and 3≤m≤⌊n/2⌋, then ⌊n/2⌋ is obtained.]]>
Copyrights © 2024
