Nordhaus-Gaddum bounds for upper total domination
From MaRDI portal
Publication:5089900
DOI10.7494/OPMATH.2022.42.4.573zbMATH Open1492.05115MaRDI QIDQ5089900FDOQ5089900
Authors: Teresa W. Haynes, Michael A. Henning 
Publication date: 15 July 2022
Published in: Opuscula Mathematica (Search for Journal in Brave)
Recommendations
Cites Work
- Total domination in graphs
- Total domination in graphs
- A survey of Nordhaus-Gaddum type relations
- On Complementary Graphs
- Title not available (Why is that?)
- Some nordhaus‐‐ gaddum‐type results
- Nordhaus-Gaddum inequalities for domination in graphs
- Nordhaus--Gaddum bounds for independent domination
- Nordhaus-Gaddum bounds for total domination
- Title not available (Why is that?)
- On the product of upper irredundance numbers of a graph and its complement
- Topics in Domination in Graphs
- On the upper total domination number of Cartesian products of graphs
- On a Nordhaus-Gaddum type problem for independent domination
- Structures of domination in graphs
- Nordhaus-Gaddum bounds for domination sums of graphs with minimum degree at least two or three
- Nordhaus-Gaddum type results for domination sums in graphs with minimum degree at least four, five or six
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
- Title not available (Why is that?)
- 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)
