On total domination in the Cartesian product of graphs
From MaRDI portal
Publication:1656910
DOI10.7151/dmgt.2039zbMath1392.05086arXiv1607.01909OpenAlexW2963222834MaRDI QIDQ1656910
Tatiana Romina Hartinger, Boštjan Brešar, Tim Kos, Martin Milanič
Publication date: 10 August 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.01909
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
On coupon coloring of Cartesian product of some graphs ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ Total \(k\)-domination in Cartesian product of complete graphs ⋮ A Vizing-type result for semi-total domination ⋮ Total domination in generalized prisms and a new domination invariant
Cites Work
- A survey of selected recent results on total domination in graphs
- On the total domination number of Cartesian products of graphs
- Construction of trees and graphs with equal domination parameters
- Vizing's conjecture: a survey and recent results
- Paired-domination of Cartesian products of graphs and rainbow domination
- Total Domination in Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On total domination in the Cartesian product of graphs