An Optimal Strongly Identifying Code in the Infinite Triangular Grid
暂无分享,去创建一个
[2] Iiro Honkala,et al. An Optimal Edge-Robust Identifying Code in the Triangular Lattice , 2004 .
[3] IIRO HONKALA,et al. On identifying codes in the triangular and square grids , 2004, SIAM J. Comput..
[4] Antoine Lobstein,et al. Identifying Codes with Small Radius in Some Infinite Regular Graphs , 2002, Electron. J. Comb..
[5] Tero Laihonen. Optimal Codes for Strong Identification , 2002, Eur. J. Comb..
[6] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[7] Mark G. Karpovsky,et al. On a New Class of Codes for Identifying Vertices in Graphs , 1998, IEEE Trans. Inf. Theory.
[8] Peter J. Slater,et al. Fault-tolerant locating-dominating sets , 2002, Discret. Math..
[9] Iiro S. Honkala,et al. General Bounds for Identifying Codes in Some Infinite Regular Graphs , 2001, Electron. J. Comb..
[10] Iiro S. Honkala,et al. An optimal locating-dominating set in the infinite triangular grid , 2006, Discret. Math..
[11] Tero Laihonen,et al. Families of optimal codes for strong identification , 2002, Discret. Appl. Math..
[12] Iiro S. Honkala,et al. On strongly identifying codes , 2002, Discret. Math..