Where academic tradition
meets the exciting future

On Cages Admitting Identifying Codes

Tero Laihonen, On Cages Admitting Identifying Codes. European Journal of Combinatorics 29(3), 737–741, 2008.

Abstract:

The problem of graphs admitting identifying codes is a recent topic. In this paper, we solve a question concerning the existence of ℓ-regular graphs admitting (1,≤ℓ)-identifying code. Moreover, our girth approach gives some improvements on the number of vertices of graphs which admit identifying codes

BibTeX entry:

@ARTICLE{jLaihonen_Tero08a,
  title = {On Cages Admitting Identifying Codes},
  author = {Laihonen, Tero},
  journal = {European Journal of Combinatorics},
  volume = {29},
  number = {3},
  publisher = {Elsevier},
  pages = {737–741},
  year = {2008},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 2

Edit publication