The Outer-Paired Domination of Graphs
From MaRDI portal
Recommendations
Cites work
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Defending the Roman Empire---a new strategy
- scientific article; zbMATH DE number 5823716 (Why is no real title available?)
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 3914371 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- On domination and independent domination numbers of a graph
- On the outer-connected domination in graphs
- Paired-domination in graphs
- Rainbow domination in graphs
- Roman domination in graphs.
- The outer-connected domination number of a graph
- Total domination in graphs
Cited in
(4)
This page was built for publication: The Outer-Paired Domination of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114861)