Exact 2-step domination in graphs

DOI10.21136/MB.1995.126228MaRDI QIDQ4857887zbMATH OpenOpenAlexFDO

Authors Gary Chartrand, Moazzem Hossain, Kelly Schultz, Frank Harary

Publication date 24 January 1996

Full work available at URL https://eudml.org/doc/223434, http://www.emis.de/journals/MB/120.2/2.html

zbMATH Keywords

2-step dominationcyclespaths

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 2197935
• On exact \(n\)-step domination
• Distance domination in partitioned graphs
• The step domination number of a graph
• scientific article; zbMATH DE number 1792592

Cited in

(12)

• On exact \(n\)-step domination
• Algorithm and hardness results on hop domination in graphs
• On 2-step and hop dominating sets in graphs
• scientific article; zbMATH DE number 6531253 (Why is no real title available?)
• scientific article; zbMATH DE number 2197935 (Why is no real title available?)
• scientific article; zbMATH DE number 2230268 (Why is no real title available?)
• scientific article; zbMATH DE number 2230323 (Why is no real title available?)
• Further results on the hop domination number of a graph
• Hop domination on subclasses of perfect graphs
• NP-completeness of some generalized hop and step domination parameters in graphs
• Polynomial time algorithms for hop domination
• Hop domination in chordal bipartite graphs

This page was built for publication: Exact $2$-step domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857887)