Lower bounds for the domination number and the total domination number of direct product graphs
type: Item
instance of: scholarly article
title: Lower bounds for the domination number and the total domination number of direct product graphs
zbMATH Open document ID: 1221.05263
author: Gašper Mekiš
published in: Discrete Mathematics
publication date: 2010-10-28T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5807507
zbMATH Keywords: dominating set
zbMATH Keywords: domination number
zbMATH Keywords: total dominating set
zbMATH Keywords: total domination number
zbMATH Keywords: direct product graphs
zbMATH Keywords: complete graph
MaRDI profile type: Publication
full work available at URL: j.disc.2010.07.015
OpenAlex ID: W2071641257
cites work: Dominating direct products of graphs
cites work: Some results on total domination in direct products of graphs
cites work: On the total domination number of cross products of graphs
cites work: On the domination number of cross products of graphs
cites work: Q4523707
cites work: Perfect r-domination in the Kronecker product of three cycles
cites work: Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
cites work: An almost complete description of perfect codes in direct products of cycles
cites work: On a Vizing-like conjecture for direct product graphs
cites work: Q4505117
cites work: Q4937425
cites work: Associative graph products and their independence, domination and coloring numbers
cites work: Total Domination in Categorical Products of Graphs
cites work: Idomatic partitions of direct products of complete graphs
cites work: Q4936660
cites work: Perfect codes in direct products of cycles-a complete characterization
DOI: 10.1016/J.DISC.2010.07.015
description: scientific article; zbMATH DE number 5807507