Cartesian product graphs and k-tuple total domination

DOI10.2298/FIL1819713KzbMath1499.05472arXiv1509.08208WikidataQ127989703 ScholiaQ127989703MaRDI QIDQ5086876

Rebecca J. Stones, Behnaz Pahlavsay, Adel P. Kazemi

Publication date: 7 July 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.08208

zbMATH Keywords

Vizing's conjectureCartesian product of graphs\(k\)-tuple total dominationrook's graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Graphs with unique maximum packing of closed neighborhoods ⋮ (Open) packing number of some graph products ⋮ Multiple Domination ⋮ 3-tuple total domination number of Rook's graphs ⋮ New bounds on the double total domination number of graphs

Cites Work

• A note on total and paired domination of Cartesian product graphs
• \(k\)-tuple total domination in graphs
• On integer domination in graphs and Vizing-like problems
• On the \(\{k\}\)-domination number of Cartesian products of graphs
• On packing and covering numbers of graphs
• Fractional domination of strong direct products
• An inequality related to Vizing's conjecture
• Packing in trees
• On the total domination number of Cartesian products of graphs
• \(k\)-tuple total domination in cross products of graphs
• Integer domination of Cartesian product graphs
• Vizing's conjecture: a survey and recent results
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cartesian product graphs and k-tuple total domination