Metric dimension of maximal outerplanar graphs

From MaRDI portal
Publication:2045286

DOI10.1007/S40840-020-01068-6zbMATH Open1478.05038arXiv1903.11933OpenAlexW3127933750MaRDI QIDQ2045286FDOQ2045286


Authors: Mercè Claverol, Gregorio Hernández, C. Hernando, Mercè Mora, Alfredo García, Montserrat Maureso, Javier Tejel Edit this on Wikidata


Publication date: 12 August 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Abstract: In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if is the metric dimension of a maximal outerplanar graph G of order n, we prove that and that the bounds are tight. We also provide linear algorithms to decide whether the metric dimension of G is 2 and to build a resolving set of size lceilfrac2n5ceil for G. Moreover, we characterize the maximal outerplanar graphs with metric dimension 2.


Full work available at URL: https://arxiv.org/abs/1903.11933




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Metric dimension of maximal outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045286)