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

A1 Refereed original research article in a scientific journal

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

Authors: Honkala I, Hudry O, Lobstein A

Publisher: ELSEVIER SCIENCE BV

Publication year: 2015

Journal: Information Processing Letters

Journal name in source: INFORMATION PROCESSING LETTERS

Journal acronym: INFORM PROCESS LETT

Volume: 115

Issue: 9

First page : 699

Last page: 702

Number of pages: 4

ISSN: 0020-0190

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

Abstract

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.