Total Dominating Sets in Maximal Outerplanar Graphs
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-017-1802-7
Abstract: In this note we present an alternative proof of the result by Dorfling et al. (Discrete Math 339(3):1180–1188, 2016) establishing that any maximal outerplanar graph of order $$n \ge 5$$n≥5 has a total dominating set of… read more here.
Keywords: maximal outerplanar; outerplanar; outerplanar graphs; total dominating ... See more keywords
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
Sign Up to like & getrecommendations! Published in 2018 at "Algorithmica"
DOI: 10.1007/s00453-018-0464-z
Abstract: We present space-efficient algorithms for computing cut vertices in a given graph with n vertices and m edges in linear time using $$O(n+\min \{m,n\log \log n\})$$O(n+min{m,nloglogn}) bits. With the same time and using $$O(n+m)$$O(n+m) bits,… read more here.
Keywords: biconnected components; log; outerplanar graphs; space efficient ... See more keywords
Metric Dimension of Maximal Outerplanar Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-020-01068-6
Abstract: In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if $$\beta (G)$$ β ( G ) denotes the metric dimension of a maximal outerplanar graph G of order n ,… read more here.
Keywords: outerplanar graphs; metric dimension; maximal outerplanar; dimension ... See more keywords