2-distance paired-dominating number of graphs
From MaRDI portal
(Redirected from Publication:489733)
Recommendations
Cites work
- scientific article; zbMATH DE number 1185309 (Why is no real title available?)
- scientific article; zbMATH DE number 1743834 (Why is no real title available?)
- scientific article; zbMATH DE number 2108130 (Why is no real title available?)
- Distance paired domination numbers of graphs
- Graphs with large paired-domination number
- On Representatives of Subsets
- On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)
- Paired-domination in claw-free cubic graphs
- Paired-domination in graphs
- Upper bounds on the paired-domination number
Cited in
(5)
This page was built for publication: 2-distance paired-dominating number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489733)