On upper bounds for total k-domination number via the probabilistic method

DOI10.14736/kyb-2023-4-0537OpenAlexW4386813747MaRDI QIDQ6137153

Saylí M. Sigarreta, Saylé C. Sigarreta, Hugo Cruz-Suárez

Publication date: 18 January 2024

Published in: Kybernetika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14736/kyb-2023-4-0537

zbMATH Keywords

probabilistic methoddomination\(k\)-tuple total domination

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• \(k\)-tuple total domination in graphs
• Integer linear programming models for the weighted total domination problem
• Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma
• Strong Transversals in Hypergraphs and Double Total Domination in Graphs
• Total domination in graphs
• Total Domination in Graphs

This page was built for publication: On upper bounds for total k-domination number via the probabilistic method