Restricted domination parameters in graphs

DOI10.1007/s10878-006-9037-1zbMath1130.05042OpenAlexW2030442194MaRDI QIDQ2467572

Michael A. Henning, Wayne Goddard

Publication date: 22 January 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-9037-1

zbMATH Keywords

domination numberdouble domination

Mathematics Subject Classification ID

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

Related Items (6)

Girth and total domination in graphs ⋮ Restricted power domination and zero forcing problems ⋮ Total domination in 2-connected graphs and in graphs with no induced 6-cycles ⋮ Multiple Domination ⋮ Domination versus total domination in claw-free cubic graphs ⋮ SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• \(k\)-tuple domination in graphs
• Restricted domination in graphs
• Restricted total domination in graphs
• Relating the size of a connected graph to its total and restricted domination numbers
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• \(\alpha\)-domination
• Domination in graphs with minimum degree two
• An upper bound for thek-domination number of a graph
• A new domination conception
• Bounds related to domination in graphs with minimum degree two
• Paths, Stars and the Number Three
• On Dominating Sets and Independent Sets of Graphs
• Graphs with double domination numbers
• On Double Domination in Graphs

This page was built for publication: Restricted domination parameters in graphs