# Optimal Locating-Total Dominating Sets in Strips of Height 3

• Volume: 35, Issue: 3, page 447-462
• ISSN: 2083-5892

top

## Abstract

top
A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, locating-total dominating sets in strips have been studied by Henning and Jafari Rad (2012). In particular, they have determined the sizes of the smallest locating-total dominating sets in the finite strips of height 2 for all lengths. Moreover, they state as open question the analogous problem for the strips of height 3. In this paper, we answer the proposed question by determining the smallest sizes of locating-total dominating sets in the finite strips of height 3 as well as the smallest density in the infinite strip of height 3.

## How to cite

top

Ville Junnila. "Optimal Locating-Total Dominating Sets in Strips of Height 3." Discussiones Mathematicae Graph Theory 35.3 (2015): 447-462. <http://eudml.org/doc/271210>.

@article{VilleJunnila2015,
abstract = {A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, locating-total dominating sets in strips have been studied by Henning and Jafari Rad (2012). In particular, they have determined the sizes of the smallest locating-total dominating sets in the finite strips of height 2 for all lengths. Moreover, they state as open question the analogous problem for the strips of height 3. In this paper, we answer the proposed question by determining the smallest sizes of locating-total dominating sets in the finite strips of height 3 as well as the smallest density in the infinite strip of height 3.},
author = {Ville Junnila},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {locating-total dominating set; domination; square grid; strip.; strip},
language = {eng},
number = {3},
pages = {447-462},
title = {Optimal Locating-Total Dominating Sets in Strips of Height 3},
url = {http://eudml.org/doc/271210},
volume = {35},
year = {2015},
}

TY - JOUR
AU - Ville Junnila
TI - Optimal Locating-Total Dominating Sets in Strips of Height 3
JO - Discussiones Mathematicae Graph Theory
PY - 2015
VL - 35
IS - 3
SP - 447
EP - 462
AB - A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, locating-total dominating sets in strips have been studied by Henning and Jafari Rad (2012). In particular, they have determined the sizes of the smallest locating-total dominating sets in the finite strips of height 2 for all lengths. Moreover, they state as open question the analogous problem for the strips of height 3. In this paper, we answer the proposed question by determining the smallest sizes of locating-total dominating sets in the finite strips of height 3 as well as the smallest density in the infinite strip of height 3.
LA - eng
KW - locating-total dominating set; domination; square grid; strip.; strip
UR - http://eudml.org/doc/271210
ER -

## References

top
1. [1] M. Blidia, M. Chellali, F. Maffray, J. Moncel and A. Semri, Locating-domination and identifying codes in trees, Australas. J. Combin. 39 (2007) 219-232. Zbl1136.05049
2. [2] M. Blidia and W. Dali, A characterization of locating-total domination edge critical graphs, Discuss. Math. Graph Theory 31 (2011) 197-202. doi:10.7151/dmgt.1538[Crossref] Zbl1284.05193
3. [3] M. Blidia, O. Favaron and R. Lounes, Locating-domination, 2-domination and in- dependence in trees, Australas. J. Combin. 42 (2008) 309-316.
4. [4] M. Bouznif, Algorithmes g´en´eriques en temps constant pour la résolution de problèmes combinatoires dans la classe des rotagraphes et fasciagraphes. Applica tion aux codes identifiants, dominants-localisateurs et dominants-total-localisateurs, Ph.D. Dissertation, Grenoble University (2012).
5. [5] M. Bouznif, J. Moncel and M. Preissmann, Generic algorithms for some decision problems on fasciagraphs and rotagraphs, Discrete Math. 312 (2012) 2707-2719. doi:10.1016/j.disc.2012.02.013[Crossref][WoS] Zbl1245.05126
6. [6] X.-G. Chen and M.Y. Sohn, Bounds on the locating-total domination number of a tree, Discrete Appl. Math. 159 (2011) 769-773. doi:10.1016/j.dam.2010.12.025[Crossref][WoS]
7. [7] T.W. Haynes, M.A. Henning and J. Howard, Locating and total dominating sets in trees, Discrete Appl. Math. 154 (2006) 1293-1300. doi:10.1016/j.dam.2006.01.002[Crossref] Zbl1091.05051
8. [8] M.A. Henning and N. Jafari Rad, Locating-total domination in graphs, Discrete Appl. Math. 160 (2012) 1986-1993. doi:10.1016/j.dam.2012.04.004[Crossref][WoS]
9. [9] P.J. Slater, Fault-tolerant locating-dominating sets, Discrete Math. 249 (2002) 179-189. doi:10.1016/S0012-365X(01)00244-8 [Crossref]

## NotesEmbed?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.