Some results on total domination in direct products of graphs

DOI10.7151/dmgt.1305zbMath1103.05059OpenAlexW4298057653MaRDI QIDQ5492690

Sylvain Gravier, Simon Špacapan, Sandi Klavžar, Paul Dorbec

Publication date: 16 October 2006

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://dk.um.si/Dokument.php?id=110433&dn=

zbMATH Keywords

bounddomination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

Dominating direct products of graphs ⋮ The total co-independent domination number of some graph operations ⋮ On the total \(k\)-domination in graphs ⋮ Efficient closed domination in digraph products ⋮ Total \(k\)-domination in Cartesian product graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Lower bounds for the domination number and the total domination number of direct product graphs ⋮ A survey of selected recent results on total domination in graphs ⋮ Domination-related parameters in rooted product graphs ⋮ Multiple Domination

This page was built for publication: Some results on total domination in direct products of graphs