Add to ORKGIn this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal outerplanar graphs attaining the lower bound. We also give a lower bound on the location-domination number of maximal outerplanar graphs.Postprint (published version
© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uni...
In this paper we introduce the notion of distance k-guarding applied to triangulation graphs, and a...
In this work we study the metric dimension and the location-domination number of maximal outerplanar...
In this work we study the metric dimension and the location-domination number of maximal outerplana...
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if ß...
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β...
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β...
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β...
In this article we study some variants of the domination concept attending to the connectivity of th...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uni...
In this paper, we determine upper bounds on the algebraic connectivity, denoted as a(G), of maximal ...
In this article we study some variants of the domination concept attending to the connectivity of th...
© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uni...
In this paper we introduce the notion of distance k-guarding applied to triangulation graphs, and a...
In this work we study the metric dimension and the location-domination number of maximal outerplanar...
In this work we study the metric dimension and the location-domination number of maximal outerplana...
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if ß...
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β...
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β...
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β...
In this article we study some variants of the domination concept attending to the connectivity of th...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uni...
In this paper, we determine upper bounds on the algebraic connectivity, denoted as a(G), of maximal ...
In this article we study some variants of the domination concept attending to the connectivity of th...
© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uni...
In this paper we introduce the notion of distance k-guarding applied to triangulation graphs, and a...