Year: 2024
Type: article
Abstract: The partition dimension of a graph is the minimum number of vertex partitions such that every vertex has different distances to the ordered partitions. Many resolving partitions for trees have all vertices not in an end-path in the same partition. This reduces the problem of the partition dimension of trees into finding the partition dimension of palms, the end-paths from a branch. In this paper, we construct a resolving partition for trees using resolving partitions of their palms. We also study some bounds for the partition dimension of palms and also find the partition dimension of regular palm and olive trees.
Authors: Yusuf Hafidh, Edy Tri Baskoro
Institution: Bandung Institute of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Funder: Institut Teknologi Bandung
OpenAlex ID: W4405155292