Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 1)
Codes Identifying Sets of Vertices
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Minimal identifying codes in trees and planar graphs with large girth
European Journal of Combinatorics
Partial linear spaces and identifying codes
European Journal of Combinatorics
Locating and identifying codes in circulant networks
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.