Bounding the locating-total domination number of a tree in terms of its annihilation number
From MaRDI portal
Publication:1630920
DOI10.7151/dmgt.2063zbMath1401.05221OpenAlexW2794821095MaRDI QIDQ1630920
Publication date: 5 December 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2063
Related Items (5)
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs ⋮ Some more updates on an annihilation number conjecture: pros and cons ⋮ Locating-total domination number of cacti graphs ⋮ Locating-total domination in grid graphs ⋮ On an annihilation number conjecture
Cites Work
- Unnamed Item
- Relating the annihilation number and the 2-domination number of a tree
- Locating-total domination in graphs
- Bounds on the locating-total domination number of a tree
- Graphs with equal independence and annihilation numbers
- Independence and the Havel-Hakimi residue
- Relating the annihilation number and the total domination number of a tree
- Locating and total dominating sets in trees
- A characterization of locating-total domination edge critical graphs
- On locating and differetiating-total domination in trees
- On domination and annihilation in graphs with claw-free blocks
This page was built for publication: Bounding the locating-total domination number of a tree in terms of its annihilation number