## Location-domination in line graphs

- Florent Foucaud, Michael A. Henning
- Discrete Mathematics
- 2017

@article{Chellali2009LocatingtotalDC, title={Locating-total domination critical graphs}, author={Mustapha Chellali and Nader Jafari Rad}, journal={Australasian J. Combinatorics}, year={2009}, volume={45}, pages={227-234} }

- Published 2009 in Australasian J. Combinatorics

A locating-total dominating set of a graph G = (V (G), E(G)) with no isolated vertex is a set S ⊆ V (G) such that every vertex of V (G) is adjacent to a vertex of S and for every pair of distinct vertices u and v in V (G) − S, N(u) ∩ S = N(v) ∩ S. Let γ t (G) be the minimum cardinality of a locating-total dominating set of G. A graph G is said to be… CONTINUE READING

### Presentations referencing similar topics