2013/12/03 by Carmen Hernando, Mercè Ferrater Mora, Hernando, C. +3
Computer Science · Engineering · #05C35 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1312.0772
openalex publication_date 2013/12/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 complement G. The global location-domination number λg(G) is the minimum cardinality of a global LD-set of G. In this work, we give some relations between locating-dominating sets and the location-domination number in a graph and its complement.