Connected domination in maximal outerplanar graphs

DOI10.1016/J.DAM.2020.01.033MaRDI QIDQ2192107zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

outerplanar graphconnected dominationstriped maximal outerplanar graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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

• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
• A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
• Bounds on the connected domination number of a graph
• Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
• Complexity of the maximum leaf spanning tree problem on planar and regular graphs
• Connected domination number of a graph and its complement
• Connected domination of regular graphs
• Connected domination stable graphs upon edge addition
• Connected domination: vertex criticality and matchings
• Dominating sets in planar graphs
• Dominating sets of maximal outerplanar graphs
• Matching properties in connected domination critical graphs
• On dominating sets of maximal outerplanar and planar graphs
• On dominating sets of maximal outerplanar graphs
• On graphs for which the connected domination number is at most the total domination number
• On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem
• On the secure domination numbers of maximal outerplanar graphs
• Total domination in maximal outerplanar graphs
• Total domination in maximal outerplanar graphs. II.

Cited in

(9)

• scientific article; zbMATH DE number 5823716 (Why is no real title available?)
• Outer-\(k\)-connected component domination in graphs
• Domination and outer connected domination in maximal outerplanar 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)