On cages admitting identifying codes

: Laihonen T

Publisher: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD

: 2008

: European Journal of Combinatorics

: EUROPEAN JOURNAL OF COMBINATORICS

: EUR J COMBIN

: 29

: 3

: 737

: 741

: 5

: 0195-6698

DOI: https://doi.org/10.1016/j.ejc.2007.02.016

The problem of graphs admitting identifying codes is a recent topic. In this paper, we solve a question concerning the existence of l-regular graphs admitting (1, <= l)-identifying code. Moreover, our girth approach gives some improvements on the number of vertices of graphs which admit identifying codes. (C) 2007 Elsevier Ltd. All rights reserved.