On the ensemble of optimal dominating and locating-dominating codes in a graph



: Honkala I, Hudry O, Lobstein A

Publisher: ELSEVIER SCIENCE BV

: 2015

: Information Processing Letters

: INFORMATION PROCESSING LETTERS

: INFORM PROCESS LETT

: 115

: 9

: 699

: 702

: 4

: 0020-0190

DOI: https://doi.org/10.1016/j.ipl.2015.04.005(external)


We study the ensemble of all the different optimal dominating (resp., locating-dominating) codes C, i.e., such that vertical bar C vertical bar = d(G) (resp., vertical bar C vertical bar = l(G)) in a graph G, and strongly link this problem to that of induced subgraphs of Johnson graphs. (C) 2015 Elsevier B.V. All rights reserved.




Last updated on 2024-26-11 at 12:15