A short proof of a result on a Vizing-like problem for integer total domination

DOI10.1007/s10878-008-9201-xzbMath1206.90200OpenAlexW2142278852MaRDI QIDQ604746

Michael A. Henning

Publication date: 12 November 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9201-x

zbMATH Keywords

Cartesian product

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Total \(\{k\}\)-domination in special graphs

Cites Work

• Real and integer domination in graphs
• On the total domination number of Cartesian products of graphs
• Unnamed Item

This page was built for publication: A short proof of a result on a Vizing-like problem for integer total domination