On locating-domination in graphs | Zendy

Mustapha Chellali | Zendy; Malika Mimouni | Zendy; Peter J. Slater | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On locating-domination in graphs

Author(s) -

Mustapha Chellali,

Malika Mimouni,

Peter J. Slater

Publication year - 2010

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.1488

Subject(s) - combinatorics , mathematics , dominating set , cardinality (data modeling) , domination analysis , graph , upper and lower bounds , discrete mathematics , vertex (graph theory) , computer science , data mining , mathematical analysis

A set D of vertices in a graph G = (V; E) is a locating-dominating set (LDS) if for every two vertices u; v of V D the sets N(u) \ D and N(v) \ D are non-empty and dieren t. The locating-domination number L(G) is the minimum cardinality of a LDS of G; and the upper locating-domination number, L(G) is the maximum cardinality of a minimal LDS of G. We present dieren t bounds on L(G) and 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