A characterization of locating-total domination edge critical graphs
Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 1, pp. 197-202
Voir la notice de l'article provenant de la source Library of Science
For a graph G = (V,E) without isolated vertices, a subset D of vertices of V is a total dominating set (TDS) of G if every vertex in V is adjacent to a vertex in D. The total domination number γₜ(G) is the minimum cardinality of a TDS of G. A subset D of V which is a total dominating set, is a locating-total dominating set, or just a LTDS of G, if for any two distinct vertices u and v of V(G)∖D, N_G(u) ∩ D ≠ N_G(v) ∩ D. The locating-total domination number γ_L^t(G) is the minimum cardinality of a locating-total dominating set of G. A graph G is said to be a locating-total domination edge removal critical graph, or just a γ_L^t+-ER-critical graph, if γ_L^t(G-e) > γ_L^t(G) for all e non-pendant edge of E. The purpose of this paper is to characterize the class of γ_L^t+-ER-critical graphs.
Keywords:
locating-domination, critical graph
@article{DMGT_2011_31_1_a12,
author = {Blidia, Mostafa and Dali, Widad},
title = {A characterization of locating-total domination edge critical graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {197--202},
publisher = {mathdoc},
volume = {31},
number = {1},
year = {2011},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2011_31_1_a12/}
}
TY - JOUR AU - Blidia, Mostafa AU - Dali, Widad TI - A characterization of locating-total domination edge critical graphs JO - Discussiones Mathematicae. Graph Theory PY - 2011 SP - 197 EP - 202 VL - 31 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2011_31_1_a12/ LA - en ID - DMGT_2011_31_1_a12 ER -
Blidia, Mostafa; Dali, Widad. A characterization of locating-total domination edge critical graphs. Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 1, pp. 197-202. http://geodesic.mathdoc.fr/item/DMGT_2011_31_1_a12/