\(k\)-tuple total domination in cross products of graphs

DOI10.1007/s10878-011-9389-zzbMath1261.90073MaRDI QIDQ1928523

Adel P. Kazemi, Michael A. Henning

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9389-z

zbMATH Keywords

cross product; total domination; \(k\)-tuple total domination

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Related Items

Cartesian product graphs and k-tuple total domination, On the double total dominator chromatic number of graphs, Signed total double Roman k-domination in graphs, Unnamed Item, A note on the \(k\)-tuple total domination number of a graph, On the algorithmic complexity of \(k\)-tuple total domination, \(k\)-tuple total domination in complementary prisms, Algorithmic aspects of \(k\)-tuple total domination in graphs, On the total \(k\)-domination in graphs, Total \(k\)-domination in Cartesian product graphs, 3-tuple total domination number of Rook's graphs, New bounds on the double total domination number of graphs, Total $k$-domination in strong product graphs, Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs, \(k\)-tuple total restrained domination in complementary prisms, Total limited packing in graphs, Multiple Domination

Cites Work

• Unnamed Item
• \(k\)-tuple total domination in graphs
• On the total domination number of cross products of graphs
• \(k\)-tuple domination in graphs
• On the ratios between packing and domination parameters of a graph
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Associative graph products and their independence, domination and coloring numbers
• Total Domination in Categorical Products of Graphs