A1 Refereed original research article in a scientific journal
On cages admitting identifying codes
Authors: Laihonen T
Publisher: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
Publication year: 2008
Journal: European Journal of Combinatorics
Journal name in source: EUROPEAN JOURNAL OF COMBINATORICS
Journal acronym: EUR J COMBIN
Volume: 29
Issue: 3
First page : 737
Last page: 741
Number of pages: 5
ISSN: 0195-6698
DOI: https://doi.org/10.1016/j.ejc.2007.02.016
Abstract
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.
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.
UTU Research Portal