Pages that link to "Item:Q708327"
From MaRDI portal
The following pages link to \(k\)-tuple total domination in graphs (Q708327):
Displayed 40 items.
- New bounds on the signed total domination number of graphs (Q274707) (← links)
- 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)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- A note on domination and total domination in prisms (Q1698053) (← links)
- Total \(k\)-domination in Cartesian product graphs (Q1705225) (← 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)
- Domination for Latin square graphs (Q2045392) (← links)
- 3-tuple total domination number of Rook's graphs (Q2062669) (← links)
- New bounds on the double total domination number of graphs (Q2064931) (← links)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- Domination on hyperbolic graphs (Q2198410) (← links)
- Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Total $k$-domination in strong product graphs (Q2420408) (← 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)
- Total limited packing in graphs (Q2520799) (← links)
- Graphs of Large Linear Size Are Antimagic (Q2800541) (← 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)
- Multiple Domination (Q3384609) (← links)
- From Italian domination in lexicographic product graphs to w-domination in graphs (Q5066972) (← links)
- Cartesian product graphs and k-tuple total domination (Q5086876) (← links)
- On the double total dominator chromatic number of graphs (Q5101880) (← links)
- <i>k</i>-tuple restrained domination in graphs (Q5163030) (← links)
- Roman k-tuple domination number of a graph (Q5164960) (← links)
- Signed total double Roman k-domination in graphs (Q5216448) (← links)
- (Q5377028) (← links)
- Hardness results of global total \(k\)-domination problem in graphs (Q5918768) (← links)
- A note on the \(k\)-tuple total domination number of a graph (Q5964651) (← links)
- From \(w\)-domination in graphs to domination parameters in lexicographic product graphs (Q6102213) (← links)
- On upper bounds for total k-domination number via the probabilistic method (Q6137153) (← links)
- On the domination of triangulated discs (Q6178045) (← links)