منابع مشابه
Location-domination in line graphs
A set D of vertices of a graph G is locating if every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩ D ≠ N(v) ∩ D, where N(u) denotes the open neighborhood of u. If D is also a dominating set (total dominating set), it is called a locating-dominating set (respectively, locating-total dominating set) of G. A graph G is twin-...
متن کاملOn global location-domination in bipartite graphs
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locatingdominating sets of minimum cardinality are called LD-codes and the cardinality of an LD-code is the location-domination number λ(G). An LD-set S of a graph G is global if it is an LD-set of both G and its compleme...
متن کاملLocation-domination and matching in cubic graphs
A dominating set of a graph G is a set D of vertices of G such that every vertex outside D is adjacent to a vertex in D. A locating-dominating set of G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩ D 6= N(v) ∩ D where N(u) denotes the open neighborhood of u...
متن کاملLocation-2-Domination in Simple Graphs
In this paper the definition of Location-2-Domination and minimum cardinality of Location-2-Domination are introduced and denoted by R D(G), and a theorem to find Location-2-dominating set for Path, cycle, Theta graph and Trees in different Kinds are introduced. AMS subject classification: 05C69.
متن کاملOn global location-domination in graphs∗
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality are called LD-codes and the cardinality of an LD-code is the location-domination number λ(G). An LD-set S of a graph G is global if it is an LD-set of both G and its complem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.05.020