Bounds on the locating-total domination number of a tree
From MaRDI portal
Publication:534338
DOI10.1016/j.dam.2010.12.025zbMath1223.05207OpenAlexW2066524557MaRDI QIDQ534338
Publication date: 17 May 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.025
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (24)
A note on the locating-total domination in graphs ⋮ Revisiting and Improving Upper Bounds for Identifying Codes ⋮ Bounding the locating-total domination number of a tree in terms of its annihilation number ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ Relating the total domination number and the annihilation number for quasi-trees and some composite graphs ⋮ Location-domination in line graphs ⋮ Domination parameters in hypertrees and sibling trees ⋮ Bounds on the locating Roman domination number in trees ⋮ Algorithmic results on locating-total domination in graphs ⋮ Bounds on the differentiating-total domination number of a tree ⋮ Locating-total domination in graphs ⋮ Bounds on the locating-domination number and differentiating-total domination number in trees ⋮ Locating-total domination number of cacti graphs ⋮ Unnamed Item ⋮ Bounds on locating total domination number of the Cartesian product of cycles and paths ⋮ Bounds on the identifying codes in trees ⋮ Bounds on the locating-total domination number in trees ⋮ Domination Parameters in Hypertrees ⋮ Optimal locating-total dominating sets in strips of height 3 ⋮ Locating-Domination and Identification ⋮ Locating-total domination in grid graphs ⋮ A note on the complexity of locating-total domination in graphs ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Locating-paired-dominating sets in square grids
Cites Work
This page was built for publication: Bounds on the locating-total domination number of a tree
