On the bounded domination number of tournaments

DOI10.1016/S0012-365X(00)00029-7zbMath0948.05040OpenAlexW2023067139WikidataQ127125085 ScholiaQ127125085MaRDI QIDQ1567627

C. K. Wong, Da-Wei Wang, Xiao-Yun Lu

Publication date: 21 June 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00029-7

zbMATH Keywords

digraphtournamentdomination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Absorbant of generalized de Bruijn digraphs ⋮ The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments ⋮ The domination number of round digraphs ⋮ Finding kings in tournaments ⋮ Regular tournaments with minimum split domination number and cycle extendability ⋮ Orientable domination in product-like graphs

This page was built for publication: On the bounded domination number of tournaments