Corrections to the article "The metric dimension of graph with pendant edges" [Journal of Combinatorial Mathematics and Combinatorial Computing, 65 (2008) 139--145]
D. Kuziak, J. A. Rodriguez-Velazquez, I. G. Yero

TL;DR
This paper corrects and clarifies the results of a previous study on the metric dimension of graphs with pendant edges, resolving two open problems and ensuring the accuracy of the original findings.
Contribution
It provides necessary corrections to prior results and solves two previously open problems related to the metric dimension of graphs with pendant edges.
Findings
Previous results were incorrect and have been corrected.
Two open problems in the original paper are now solved.
The corrected results refine understanding of the metric dimension in specific graph classes.
Abstract
We show that the principal results of the article "The metric dimension of graph with pendant edges" [Journal of Combinatorial Mathematics and Combinatorial Computing, 65 (2008) 139--145] do not hold. In this paper we correct the results and we solve two open problems described in the above mentioned paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems
