2017/11/03 by Hernando, Carmen, Mora, Mercè, Pelayo, Ignacio M. · 1 citation
#05C12 #05C35 #05C69 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1711.01951
A 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 GS associated with a distinguishing set S that turns out to be very helpful.