Pages that link to "Item:Q708327"
From MaRDI portal
The following pages link to \(k\)-tuple total domination in graphs (Q708327):
Displayed 10 items.
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- \(k\)-tuple total domination in complementary prisms (Q410666) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- \(k\)-tuple total domination in cross products of graphs (Q1928523) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- On upper bounds for multiple domination numbers of graphs (Q2444571) (← links)
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589) (← links)
- \(k\)-tuple total restrained domination in complementary prisms (Q2449268) (← links)
- Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291) (← links)
- COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS (Q3166754) (← links)