| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654541 | European Journal of Combinatorics | 2008 | 5 Pages |
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,≤ℓ)(1,≤ℓ)-identifying code. Moreover, our girth approach gives some improvements on the number of vertices of graphs which admit identifying codes.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tero Laihonen,