A new upper bound on the total domination number in graphs with minimum degree six
From MaRDI portal
Publication:2043347
DOI10.1016/j.dam.2021.05.033zbMath1469.05131OpenAlexW3172749104MaRDI QIDQ2043347
Michael A. Henning, Anders Yeo
Publication date: 2 August 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.033
Hypergraphs (05C65) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items
Bounds on domination parameters in graphs: a brief survey ⋮ \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems ⋮ A note on the Tuza constant \(c_k\) for small \(k\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new lower bound on the independence number of a graph and applications
- Independence in 5-uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- Transversals in linear uniform hypergraphs
- Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in graphs
- Some remarks on domination
- Graphs with large total domination number
- Total Domination in Graphs
