Bounds on the locating-total domination number of a tree
From MaRDI portal
Publication:534338
DOI10.1016/J.DAM.2010.12.025zbMATH Open1223.05207OpenAlexW2066524557MaRDI QIDQ534338FDOQ534338
Authors: Xuegang Chen, Moo Young Sohn 
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
Recommendations
- Bounds on the locating-total domination number in trees
- A note on the locating-total domination in trees
- Bounds on the disjunctive total domination number of a tree
- On locating and differetiating-total domination in trees
- Bounds on the locating-domination number and differentiating-total domination number in trees
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (31)
- Locating-total domination number of cacti graphs
- Bounds on the identifying codes in trees
- My favorite domination conjectures in graph theory are bounded
- Optimal locating-total dominating sets in strips of height 3
- On locating and differetiating-total domination in trees
- Domination parameters in hypertrees
- Revisiting and improving upper bounds for identifying codes
- Locating-paired-dominating sets in square grids
- Locating-total domination in graphs
- Bounding the locating-total domination number of a tree in terms of its annihilation number
- A note on the locating-total domination in trees
- Locating-domination and identification
- Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
- Progress towards the two-thirds conjecture on locating-total dominating sets
- Title not available (Why is that?)
- Locating-total dominating sets in twin-free graphs: a conjecture
- Location-domination in line graphs
- Bounds on the locating-total domination number in trees
- Bounds on the differentiating-total domination number of a tree
- Some results on the open locating-total domination number in graphs
- A note on the locating-total domination in graphs
- Domination parameters in hypertrees and sibling trees
- Bounds on locating total domination number of the Cartesian product of cycles and paths
- An extension of locating-total domination problem and its complexity
- Bounds on the locating Roman domination number in trees
- A note on the complexity of locating-total domination in graphs
- A sharp lower bound for locating-dominating sets in trees
- Bounds on the locating-domination number and differentiating-total domination number in trees
- Algorithmic results on locating-total domination in graphs
- Locating-total domination in grid graphs
- Locating and total dominating sets in trees
This page was built for publication: Bounds on the locating-total domination number of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534338)
