Connected domination in maximal outerplanar graphs
From MaRDI portal
Publication:2192107
DOI10.1016/J.DAM.2020.01.033zbMATH Open1442.05167OpenAlexW3006599071MaRDI QIDQ2192107FDOQ2192107
Authors: Wei Zhuang 
Publication date: 29 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.01.033
Recommendations
- Domination and outer connected domination in maximal outerplanar graphs
- Bounds for the connected domination number of maximal outerplanar graphs
- On dominating sets of maximal outerplanar graphs
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
Cites Work
- Title not available (Why is that?)
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- On dominating sets of maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- Connected domination of regular graphs
- Dominating sets in planar graphs
- On graphs for which the connected domination number is at most the total domination number
- Title not available (Why is that?)
- Connected domination: vertex criticality and matchings
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
- Total domination in maximal outerplanar graphs. II.
- Total domination in maximal outerplanar graphs
- On dominating sets of maximal outerplanar and planar graphs
- Bounds on the connected domination number of a graph
- Connected domination number of a graph and its complement
- On the secure domination numbers of maximal outerplanar graphs
- Matching properties in connected domination critical graphs
- Connected domination stable graphs upon edge addition
- On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
Cited In (9)
- Title not available (Why is that?)
- Domination and outer connected domination in maximal outerplanar graphs
- Outer-\(k\)-connected component domination in graphs
- Semipaired domination in maximal outerplanar graphs
- Bounds for the connected domination number of maximal outerplanar graphs
- Connected Domatic Number in Planar Graphs
- Dominating sets of maximal outerplanar graphs
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
- Connected domination
This page was built for publication: Connected domination in maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192107)
