Partition dimension of trees - palm approach

Yusuf Hafidh, Edy Tri Baskoro

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.


Keywords


partition dimension, tree, palm

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2024.12.2.7

References

Amrullah, The partition dimension for a subdivision of a homogeneous firecracker, Electron. J. Graph Theory Appl. 8 (2) (2020), 445–455.

I.B.K.P. Arimbawa K., E.T. Baskoro, Partition dimension of some classes of trees, Procedia Computer Science, 74 (2015), 67–72

E.T. Baskoro, D.I.D. Primaskun, Improved algorithm for the locating-chromatic number of trees, Theoretical Computer Science, 856 (2021), 165–168.

J. Cáceres, C. Hernando, M. Nora, I.M. Pelayo, and M.L. Puertas, On the metric dimensions of infinite graphs, Electron. Notes Discrete Math., 35 (2009), 15–20.

G.G. Chappell, J. Gimbel, C. Hartman, Bounds on the metric and partition dimensions of a graph, Ars Comb., 88 (2008).

G. Chartrand, E. Salehi, P. Zhang, The partition dimension of a graph, Aequationes Mathematicae, 59 (2000), 45–54.

R. Diestel, Graph Theory, Fifth Edition, Springer, 2017.

K.Q. Fredlina, E.T. Baskoro, The partition dimension of some families of trees, Procedia Computer Science, 74 (2015) 60–66

Y. Hafidh and E.T. Baskoro, Infinite trees with finite dimensions, DOI: 10.5220/0009876300002775, In Proceedings of the 1st International MIPAnet Conference on Science and Mathematics (IMC-SciMath 2019), pages 11–13, Scitepress, ISBN: 978-989-758-556-2.

Y. Hafidh and E.T. Baskoro, On the locating chromatic number of trees, Int. J. Math. Comput. Sci., 17 (2022), 377–394.

D. O. Haryeni, E.T. Baskoro, S.W. Saputro, A method to construct graphs with certain partition dimension, Electron. J. Graph Theory Appl. 7 (2) (2019), 251–263.

J.A. Rodrigues-Velázquez, I.G. Yero, M. Lemańska, On the partition dimension of trees, Discrete Applied Mathematics, 166 (2014), 204–209.

P.J. Slater, Leaves of Trees, Proc. 6th S-E Conf. Combinatorics, Graph Theory and Computing, (1975), 549–559.


Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats