Paired-domination number of a graph and its complement
From MaRDI portal
Recommendations
- Bounds on the paired domination number of graphs with minimum degree at least three
- Graphs with large paired-domination number
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- Upper bounds on the paired-domination number
- The paired-domination and the upper paired-domination numbers of graphs
Cites work
- scientific article; zbMATH DE number 1185309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2188609 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- Graphs with large paired-domination number
- Paired-domination in graphs
- Some upper bounds for the domination number
Cited in
(8)- Cubic graphs have paired-domination number at most four-seventh of their orders
- Graphs with maximum size and given paired-domination number
- A proof of a conjecture on the paired-domination subdivision number
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- scientific article; zbMATH DE number 6522554 (Why is no real title available?)
- Paired domination in graphs
- Paired-domination subdivision numbers of graphs
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
This page was built for publication: Paired-domination number of a graph and its complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998404)