On the ensemble of optimal dominating and locating-dominating codes in a graph
We study the set of all optimal locating-dominating codes in a given graph. There is a strong link between such sets and induced subgraphs of Johnson graphs. Instead of locating-dominating codes we also consider dominating codes.
domination locating-dominating codes johnson graphs combinatorial problems graph theory