Bounds for the connected domination number of maximal outerplanar graphs
From MaRDI portal
Publication:2166232
DOI10.1016/j.dam.2022.05.024zbMath1495.05215MaRDI QIDQ2166232
Xiao-Wen Qin, Shao-Liang Chen, Rong-xia Hao
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.05.024
connected dominating set; maximal outerplanar graph; connected domination number; constructive algorithm
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total domination in maximal outerplanar graphs
- An exact algorithm for connected red-blue dominating set
- Dominating sets in plane triangulations
- Enumerating minimal dominating sets in chordal graphs
- Total domination in maximal outerplanar graphs. II.
- On dominating sets of maximal outerplanar and planar graphs
- On certain spanning subgraphs of embeddings with applications to domination
- On the secure domination numbers of maximal outerplanar graphs
- Dominating sets in planar graphs
- On dominating sets of maximal outerplanar graphs
- An improved exact algorithm for minimum dominating set in chordal graphs
- Connected domination in maximal outerplanar graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Dominating sets of maximal outerplanar graphs
- Dominating Sets in Chordal Graphs
- Domination numbers of planar graphs
- Dominating sets in triangulations on surfaces
