Metric dimension of maximal outerplanar graphs

From MaRDI portal
Publication:2045286




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.



Cites work







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)