A characterization of locating-total domination edge critical graphs | Zendy

Mostafa Blidia | Zendy; Widad Dali | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A characterization of locating-total domination edge critical graphs

Author(s) -

Mostafa Blidia,

Widad Dali

Publication year - 2011

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1538

Subject(s) - combinatorics , dominating set , domination analysis , mathematics , vertex (graph theory) , graph , discrete mathematics

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 t(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) n D, NG(u)\ D 6 NG(v)\ D. The locating-total domination number t L(G)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research