On the bounded domination number of tournaments
type: Item
instance of: scholarly article
title: On the bounded domination number of tournaments
zbMATH Open document ID: 0948.05040
DOI: 10.1016/S0012-365X(00)00029-7
author: Da-Wei Wang
author: C. K. Wong
author: Xiaoyun Lu
published in: Discrete Mathematics
publication date: 2000-06-21T00:00:00Z
review text: A star of degree \(t\) in a digraph \(D\) is a union of \(t\) arcs that lead away from the same node. The \(k\)-domination number \(\gamma_k(D)\) of \(D\) is the minimum number of stars of degree at most \(k\) needed to cover the nodes of \(D\). The authors show, among other things, that if \(T\) is a tournament with \(n\) nodes, where \(n\geq 14 k\log_2k\), then \(\gamma_k(T)= \lceil n/(k+ 1)\rceil\).
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1462288
zbMATH Keywords: domination number
zbMATH Keywords: digraph
zbMATH Keywords: tournament
reviewed by: J. W. Moon
MaRDI profile type: Publication
full work available at URL: s0012-365x(00)00029-7
OpenAlex ID: W2023067139
Wikidata QID: Q127125085
description: scientific article; zbMATH DE number 1462288