An algorithm to find two distance domination parameters in a graph

DOI10.1016/0166-218X(95)00057-XzbMath0848.05040MaRDI QIDQ1917347

Henda C. Swart, Michael A. Henning, Gerd H. Fricke, Ortrud R. Oellermann

Publication date: 6 October 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmdistancedistance domination\(n\)-independence number\(n\)-independent settotal \(n\)-dominating settotal \(n\)-domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

An efficient algorithm for distance total domination in block graphs ⋮ Distance Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on total domination
• A sufficient condition for dominating cycles
• A note on distance-dominating cycles
• R-domination of block graphs
• Dominating cliques in \(P_ 5\)-free graphs
• On packing and covering numbers of graphs
• Relations between packing and covering numbers of a tree
• Efficient parallel algorithms for r-dominating set and p-center problems on trees
• The diversity of domination
• A characterization of graphs without long induced paths
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• R -Domination in Graphs
• The ratio of the distance irredundance and domination numbers of a graph

This page was built for publication: An algorithm to find two distance domination parameters in a graph