A Vizing-type result for semi-total domination
From MaRDI portal
Publication:1732092
DOI10.1016/j.dam.2018.11.023zbMath1407.05172arXiv1803.04746OpenAlexW2963955554WikidataQ128738684 ScholiaQ128738684MaRDI QIDQ1732092
Randy Davila, Elliot Krop, John Asplund
Publication date: 22 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.04746
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertices contained in all or in no minimum semitotal dominating set of a tree
- An inequality related to Vizing's conjecture
- On total domination in the Cartesian product of graphs
- On the total domination number of Cartesian products of graphs
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
- Edge weighting functions on semitotal dominating sets
- On matching and semitotal domination in graphs
- Vizing's conjecture: a survey and recent results
- Paired-domination of Cartesian products of graphs and rainbow domination
- Total Domination in Graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in claw-free cubic graphs
This page was built for publication: A Vizing-type result for semi-total domination