Nordhaus-Gaddum bounds for upper total domination
From MaRDI portal
Publication:5089900
Recommendations
Cites work
- scientific article; zbMATH DE number 2188609 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- A survey of Nordhaus-Gaddum type relations
- Nordhaus--Gaddum bounds for independent domination
- Nordhaus-Gaddum bounds for domination sums of graphs with minimum degree at least two or three
- Nordhaus-Gaddum bounds for total domination
- Nordhaus-Gaddum inequalities for domination in graphs
- Nordhaus-Gaddum type results for domination sums in graphs with minimum degree at least four, five or six
- On Complementary Graphs
- On a Nordhaus-Gaddum type problem for independent domination
- On the product of upper irredundance numbers of a graph and its complement
- On the upper total domination number of Cartesian products of graphs
- Some nordhaus‐‐ gaddum‐type results
- Structures of domination in graphs
- Topics in Domination in Graphs
- Total domination in graphs
- Total domination in graphs
Cited in
(6)- Nordhaus-Gaddum type results for total domination
- Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
- scientific article; zbMATH DE number 2188609 (Why is no real title available?)
- Toward a Nordhaus-Gaddum inequality for the number of dominating sets
- Nordhaus-Gaddum bounds for total domination
- Nordhaus-Gaddum bounds for total Roman domination
This page was built for publication: Nordhaus-Gaddum bounds for upper total domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089900)
