Locating-total dominating sets in twin-free graphs: a conjecture
From MaRDI portal
Publication:311495
zbMath1344.05104arXiv1503.02950MaRDI QIDQ311495
Florent Foucaud, Michael A. Henning
Publication date: 13 September 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.02950
Related Items (4)
Revisiting and Improving Upper Bounds for Identifying Codes ⋮ Location-domination in line graphs ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded
Cites Work
- The difference between the metric dimension and the determining number of a graph
- Locating-total domination in graphs
- Locating-total domination in claw-free cubic graphs
- Bounds on the locating-total domination number of a tree
- Locating-dominating sets in twin-free graphs
- Location-domination and matching in cubic graphs
- Locating and total dominating sets in trees
- A characterization of locating-total domination edge critical graphs
- On locating and differetiating-total domination in trees
- Domination and location in acyclic graphs
- Total domination in graphs
- Graphs with large total domination number
- Total Domination in Graphs
- A Transition from Total Domination in Graphs to Transversals in Hypergraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Locating-total dominating sets in twin-free graphs: a conjecture