Add to ORKGA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination number of G , ¿ ( G ), is the minimum cardinality of a locating-dominating set. In this work we study relationships between ¿ ( G ) and ¿ ( G ) for bipartite graphs. The main result is the characterization of all connected bipartite graphs G satisfying ¿ ( G ) = ¿ ( G ) + 1. To this aim, we define an edge-labeled graph G S associated with a distinguishing set S that turns out to be very helpfu
Domination, Global domination, Locating domination, Complement graph, Block-cactus, TreesA dominatin...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A subset D ⊆ V(G) is called a k-distance dominating set of G if every vertex in V(G)-D is within di...
© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
A dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex ...
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uni...
A dominating set S of a graph G is called locating-dominating , LD-set for short, if every ...
A dominating set of a graph G is a set D⊆ VG such that every vertex in VG- D is adjacent to at least...
A set D of vertices in a graph G = (V,E) is a locating-dominating set (LDS) if for every two vertice...
A dominating set D is called a connected dominating set, if it induces a connected subgraph in G. Si...
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a ...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
Domination, Global domination, Locating domination, Complement graph, Block-cactus, TreesA dominatin...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A subset D ⊆ V(G) is called a k-distance dominating set of G if every vertex in V(G)-D is within di...
© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
A dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex ...
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uni...
A dominating set S of a graph G is called locating-dominating , LD-set for short, if every ...
A dominating set of a graph G is a set D⊆ VG such that every vertex in VG- D is adjacent to at least...
A set D of vertices in a graph G = (V,E) is a locating-dominating set (LDS) if for every two vertice...
A dominating set D is called a connected dominating set, if it induces a connected subgraph in G. Si...
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a ...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
Domination, Global domination, Locating domination, Complement graph, Block-cactus, TreesA dominatin...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A subset D ⊆ V(G) is called a k-distance dominating set of G if every vertex in V(G)-D is within di...