Semipaired domination in maximal outerplanar graphs

Michael A. Henning () and Pawaton Kaemawichanurat ()
Additional contact information
Michael A. Henning: University of Johannesburg
Pawaton Kaemawichanurat: King Mongkut’s University of Technology Thonburi

Journal of Combinatorial Optimization, 2019, vol. 38, issue 3, No 15, 926 pages

Abstract: Abstract A subset S of vertices in a graph G is a dominating set if every vertex in $$V(G) {\setminus } S$$ V ( G ) \ S is adjacent to a vertex in S. If the graph G has no isolated vertex, then a semipaired dominating set of G is a dominating set of G with the additional property that the set S can be partitioned into two element subsets such that the vertices in each subset are at most distance two apart. The semipaired domination number $$\gamma _{\mathrm{pr2}}(G)$$ γ pr 2 ( G ) is the minimum cardinality of a semipaired dominating set of G. Let G be a maximal outerplanar graph of order n with $$n_2$$ n 2 vertices of degree 2. We show that if $$n \ge 5$$ n ≥ 5 , then $$\gamma _{\mathrm{pr2}}(G) \le \frac{2}{5}n$$ γ pr 2 ( G ) ≤ 2 5 n . Further, we show that if $$n \ge 3$$ n ≥ 3 , then $$\gamma _{\mathrm{pr2}}(G) \le \frac{1}{3}(n+n_2)$$ γ pr 2 ( G ) ≤ 1 3 ( n + n 2 ) . Both bounds are shown to be tight.

Keywords: Paired-domination; Semipaired domination number; Maximal outerplanar graphs; 05C69 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00427-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:3:d:10.1007_s10878-019-00427-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00427-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().