Pages that link to "Item:Q1928523"
From MaRDI portal
The following pages link to \(k\)-tuple total domination in cross products of graphs (Q1928523):
Displaying 17 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)
- On the total \(k\)-domination in graphs (Q1692651) (← links)
- Total \(k\)-domination in Cartesian product graphs (Q1705225) (← links)
- 3-tuple total domination number of Rook's graphs (Q2062669) (← links)
- New bounds on the double total domination number of graphs (Q2064931) (← links)
- Total $k$-domination in strong product graphs (Q2420408) (← 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)
- Multiple Domination (Q3384609) (← links)
- Cartesian product graphs and k-tuple total domination (Q5086876) (← links)
- On the double total dominator chromatic number of graphs (Q5101880) (← links)
- Signed total double Roman k-domination in graphs (Q5216448) (← links)
- (Q5377028) (← links)
- A note on the \(k\)-tuple total domination number of a graph (Q5964651) (← links)