On the upper total domination number of Cartesian products of graphs
From MaRDI portal
Publication:941836
DOI10.1007/s10878-007-9099-8zbMath1157.05042OpenAlexW2054696976MaRDI QIDQ941836
Douglas F. Rall, Paul Dorbec, Michael A. Henning
Publication date: 2 September 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9099-8
Related Items (7)
Nordhaus-Gaddum bounds for upper total domination ⋮ Total domination versus domination in cubic graphs ⋮ Edge Weighting Functions on Dominating Sets ⋮ On upper total domination versus upper domination in graphs ⋮ Edge weighting functions on semitotal dominating sets ⋮ A survey of selected recent results on total domination in graphs ⋮ Vizing's conjecture: a survey and recent results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inequality related to Vizing's conjecture
- On the total domination number of Cartesian products of graphs
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
- Total domination in graphs
- Upper total domination in claw‐free graphs
- Some remarks on domination
- Graphs with large total domination number
This page was built for publication: On the upper total domination number of Cartesian products of graphs
