Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: locating-domination

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

A characterization of locating-total domination edge critical graphs

100%

Blidia M., Dali W.

Discussiones Mathematicae Graph Theory

2011

tom 31

nr 1

197-202

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Blidia M.

1 Dali W.

1 2011

Wyniki wyszukiwania

A characterization of locating-total domination edge critical graphs