scientific article; zbMATH DE number 7057490
From MaRDI portal
Publication:5377028
zbMath1411.05210MaRDI QIDQ5377028
Publication date: 23 May 2019
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/73/ajc_v73_p280.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Relating the total \(\{2\}\)-domination number with the total domination number of graphs ⋮ Multiple Domination ⋮ New bounds on the double total domination number of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the algorithmic complexity of \(k\)-tuple total domination
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- \(k\)-tuple total domination in graphs
- \(k\)-tuple domination in graphs
- On the total \(k\)-domination in graphs
- Total \(k\)-domination in Cartesian product graphs
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- \(k\)-tuple total domination in cross products of graphs
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- A generalised upper bound for the \(k\)-tuple domination number
- On Double Domination in Graphs
This page was built for publication:
